Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "search algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Failure Correction of a Linear Array of Coupled Parallel Vertical Dipole Antennas
    Autorzy:
    Patidar, Hemant
    Mahanti, Gautam Kumar
    Muralidharan, R.
    Singh, Prasanna Kumar
    Powiązania:
    https://bibliotekanauki.pl/articles/308045.pdf
    Data publikacji:
    2020
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    array failure correction
    cuckoo search algorithm
    wide null depth
    mutual coupling
    Opis:
    In this paper, a cuckoo search algorithm based on the combined characteristics of the brood parasite behavior and Levy flights is applied to correct the radiation pattern of a linear antenna array composed of parallel dipoles with faulty elements. An effort is made to restore the radiation pattern similar to one without any faulty elements, and the difference in the values of side lobe level and wide null depth of both patterns, as well as the voltage standing wave ratio obtained from the new voltage excitations become diminished. The examples presented in this paper show the effectiveness of this algorithm in correcting the radiation pattern of a linear array of 36 and 120 dipole antennas with four and ten failed elements, respectively. The results show that the matching condition and the wide null control produced by Cuckoo Search algorithm are more efficient in comparison with the benchmark failure correction algorithm. The approach adopted herein may be applied to other array configurations as well.
    Źródło:
    Journal of Telecommunications and Information Technology; 2020, 1; 62-69
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Minimized Group Delay FIR Low Pass Filter Design Using Modified Differential Search Algorithm
    Autorzy:
    Prajapati, Sonelal
    Rai, Sanjeev
    Tiwari, Manish
    Dwivedi, Atul Kumar
    Powiązania:
    https://bibliotekanauki.pl/articles/24200750.pdf
    Data publikacji:
    2023
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    differential search optimization algorithm
    FIR filter
    optimization
    small group delay
    Opis:
    Designing a finite impulse response (FIR) filter with minimal group delay has proven to be a difficult task. Many research studies have focused on reducing pass band and stop band ripples in FIR filter design, often overlooking the optimization of group delay. While some works have considered group delay reduction, their approaches were not optimal. Consequently, the achievement of an optimal design for a filter with a low group delay value still remains a challenge. In this work, a modified differential search optimization algorithm has been used for the purpose of designing a minimal group delay FIR filter. The results obtained have been compared with the classical techniques and they turned out to be promising.
    Źródło:
    Journal of Telecommunications and Information Technology; 2023, 3; 78--84
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
    Autorzy:
    Bereta, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/308683.pdf
    Data publikacji:
    2017
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    Euclidean Steiner tree problem
    MCTS
    Monte Carlo Tree Search
    UCT algorithm
    Opis:
    This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points (terminals) on a plane, the goal is to find a connection between all the points, so that the total sum of the lengths of edges is as low as possible, while an addition of extra points (Steiner points) is allowed. Finding the minimum Steiner tree is known to be np-hard. While exact algorithms exist for this problem in 2D, their efficiency decreases when the number of terminals grows. A novel algorithm based on Upper Confidence Bound for Trees is proposed. It is adapted to the specific characteristics of Steiner trees. A simple heuristic for fast generation of feasible solutions based on Fermat points is proposed together with a correction procedure. By combing Monte Carlo Tree Search and the proposed heuristics, the proposed algorithm is shown to work better than both the greedy heuristic and pure Monte Carlo simulations. Results of numerical experiments for randomly generated and benchmark library problems (from OR-Lib) are presented and discussed.
    Źródło:
    Journal of Telecommunications and Information Technology; 2017, 4; 71-81
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-3 z 3

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies