Wszystkie pola: genetic algorithms - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: The Use of Genetic Algorithms for Searching Parameter Space in Gaussian Process Modeling
Autorzy:: Krok, A.
Powiązania:: https://bibliotekanauki.pl/articles/308239.pdf
Data publikacji:: 2015
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: Gaussian processes
genetic algorithms
Opis:: The aim of the paper is to present the possibilities of modeling the experimental data by Gaussian processes. Genetic algorithms are used for finding the Gaussian process parameters. Comparison of data modeling accuracy is made according to neural networks learned by Kalman filtering. Concrete hysteresis loops obtained by the experiment of cyclic loading are considered as the real data time series.
Źródło:: Journal of Telecommunications and Information Technology; 2015, 3; 58-63
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Computational Methods for Two-Level 0-1 Programming Problems through Distributed Genetic Algorithms
Autorzy:: Niwa, K.
Hayashida, T.
Sakawa, M.
Powiązania:: https://bibliotekanauki.pl/articles/309162.pdf
Data publikacji:: 2010
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: distributed genetic algorithm
Stackelberg solution
two-level 0-1 programming problem
Opis:: In this paper, we consider a two-level 0-1 programming problem in which there is not coordination between the decision maker (DM) at the upper level and the decision maker at the lower level. We propose a revised computational method that solves problems related to computational methods for obtaining the Stackelberg solution. Specifically, in order to improve the computational accuracy of approximate Stakelberg solutions and shorten the computational time of a computational method implementing a genetic algorithm (GA) proposed by the authors, a distributed genetic algorithm is introduced with respect to the upper level GA, which handles decision variables for the upper level DM. Parallelization of the lower level GA is also performed along with parallelization of the upper level GA. The proposed algorithm is also improved in order to eliminate unnecessary computation during operation of the lower level GA, which handles decision variables for the lower level DM. In order to verify the effectiveness of the proposed method, we propose comparisons with existing methods by performing numerical experiments to verify both the accuracy of the solution and the time required for the computation.
Źródło:: Journal of Telecommunications and Information Technology; 2010, 2; 78-87
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Multi-Objective Evolutionary Optimization of Aperiodic Symmetrical Linear Arrays
Autorzy:: Napoli, F.
Pajewski, L.
Vescovo, R.
Marciniak, M.
Powiązania:: https://bibliotekanauki.pl/articles/308614.pdf
Data publikacji:: 2017
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: antenna array
Dolph-Chebyshev array
genetic algorithms
Opis:: In this paper, a multi-objective approach is applied to the design of aperiodic linear arrays of antennas. The adopted procedure is based on a standard Matlab implementation of the Controlled Elitist Non-Dominated Sorting Genetic Algorithm II. Broadside symmetrical arrays of isotropic radiators are considered with both uniform and non-uniform excitations. The work focuses on whether, and in which design conditions, the aperiodic solutions obtained by the adopted standard multi-objective evolutionary procedure can approximate or outperform the Pareto-optimal front for the uniformspacing case computable by the Dolph-Chebyshev method.
Źródło:: Journal of Telecommunications and Information Technology; 2017, 3; 79-87
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Heuristic algorithms in topological design of telecommunication networks
Autorzy:: Karaś, P.
Powiązania:: https://bibliotekanauki.pl/articles/307692.pdf
Data publikacji:: 2003
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: topological design
network optimisation
heuristic algorithms
genetic algorithms
Opis:: The paper addresses the generic topological network design problem and considers the use of various heuristic algorithms for solving the problem. The target of the optimisation is to determine a network structure and demand allocation pattern that would minimise the cost of the network, which is given by fixed installation costs of nodes and links and variable link capacity costs described bv linear or concave functions. Input data for the optimisation consists of a list of potential node and link locations and their costs and a set of demands defined between the nodes. Since the problem is known to be NP-hard. The use of specialised heuristic algorithms is proposed. The presented approaches encompass original ideas as well as selected methods described in literature and their enhancements. The algorithms are based on the following ideas and methods: shifting of individual flows, local and global restoration of flows from chosen links or nodes, Yaged algorithm for finding local minima, Minoux greedy algorithm, simulated allocation and genetic algorithms. Efficiency of each of the proposed methods is tested on a set of numerical examples.
Źródło:: Journal of Telecommunications and Information Technology; 2003, 3; 73-82
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: Improving Population-Based Algorithms with Fitness Deterioration
Autorzy:: Wolny, A.
Schaefer, R.
Powiązania:: https://bibliotekanauki.pl/articles/308437.pdf
Data publikacji:: 2011
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: basin of attraction
clustering
fitness deterioration
genetic algorithm
optics
sequential niching
Opis:: This work presents a new hybrid approach for supporting sequential niching strategies called Cluster Supported Fitness Deterioration (CSFD). Sequential niching is one of the most promising evolutionary strategies for analyzing multimodal global optimization problems in the continuous domains embedded in the vector metric spaces. In each iteration CSFD performs the clustering of the random sample by OPTICS algorithm and then deteriorates the fitness on the area occupied by clusters. The selection pressure pushes away the next-step sample (population) from the basins of attraction of minimizers already recognized, speeding up finding the new ones. The main advantages of CSFD are low memory an computational complexity even in case of large dimensional problems and high accuracy of deterioration obtained by the flexible cluster definition delivered by OPTICS. The paper contains the broad discussion of niching strategies, detailed definition of CSFD and the series of the simple comparative tests.
Źródło:: Journal of Telecommunications and Information Technology; 2011, 4; 31-44
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Synthesis of Reconfigurable Multiple Shaped Beams of a Concentric Circular Ring Array Antenna Using Evolutionary Algorithms
Autorzy:: Dubey, Sanjay Kumar
Mandal, Debasis
Powiązania:: https://bibliotekanauki.pl/articles/2200965.pdf
Data publikacji:: 2023
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: cosec2 beam
differential evolution algorithm (DE)
firefly algorithm (FA)
flat top beam
genetic algorithm (GA)
multiple shaped beam patterns
pencil beam
Opis:: The approach described in this paper uses evolutionary algorithms to create multiple-beam patterns for a concentric circular ring array (CCRA) of isotropic antennas using a common set of array excitation amplitudes. The flat top, cosec2, and pencil beam patterns are examples of multiple-beam patterns. All of these designs have an upward angle of θ = 0◦. All the patterns are further created in three azimuth planes (φ = 0◦, 5◦, and 10◦). To create the necessary patterns, non-uniform excitations are used in combination with evenly spaced isotropic components. For the flat top and cosecant-squared patterns, the best combination of common components, amplitude and various phases is applied, whereas the pencil beam pattern is produced using the common amplitude only. Differential evolutionary algorithm (DE), genetic algorithm (GA), and firefly algorithm (FA) are used to generate the best 4-bit discrete magnitudes and 5-bit discrete phases. These discrete excitations aid in lowering the feed network design complexity and the dynamic range ratio (DRR). A variety of randomly selected azimuth planes are used to verify the excitations as well. With small modifications in the desired parameters, the patterns are formed using the same excitation. The results proved both the efficacy of the suggested strategy and the dominance of DE over GA as well as FA.
Źródło:: Journal of Telecommunications and Information Technology; 2023, 1; 8--17
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "genetic algorithms" wg kryterium: Wszystkie pola

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język