Informacja

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

Wyszukujesz frazę "evolutionary computations" wg kryterium: Temat


Wyświetlanie 1-5 z 5
Tytuł:
AH Method: a Novel Routine for Vicinity Examination of the Optimum Found with a Genetic Algorithm
Autorzy:
Piętak, Daniel Andrzej
Bilski, Piotr
Napiorkowski, Paweł Jan
Powiązania:
https://bibliotekanauki.pl/articles/2200688.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
heuristics
evolutionary computations
genetic algorithms
uncertainty estimation
parameter study
Opis:
The paper presents a novel heuristic procedure (further called the AH Method) to investigate function shape in the direct vicinity of the found optimum solution. The survey is conducted using only the space sampling collected during the optimization process with an evolutionary algorithm. For this purpose the finite model of point-set is considered. The statistical analysis of the sampling quality based upon the coverage of the points in question over the entire attraction region is exploited. The tolerance boundaries of the parameters are determined for the user-specified increase of the objective function value above the found minimum. The presented test-case data prove that the proposed approach is comparable to other optimum neighborhood examination algorithms. Also, the AH Method requires noticeably shorter computational time than its counterparts. This is achieved by a repeated, second use of points from optimization without additional objective function calls, as well as significant repository size reduction during preprocessing.
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 4; 695--708
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stimulus with limited band optimization for analogue circuit testing
Autorzy:
Golonek, T.
Jantos, P.
Rutkowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/221641.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
analogue circuit testing
faults isolation
evolutionary computations
amplitude spectrum
Opis:
The paper presents an analogue circuit testing method that engages the analysis of the time response to a nonperiodic stimulus specialized for the verification of selected specifications. The decision about the current circuit diagnostic state depends on an amplitude spectrum decomposition of the time response measured during the test. A shape of the test excitation spectrum is optimized with the use of a differential evolution algorithm and it allows for achieving maximum fault coverage and the optimal conditions for fault isolation. Genotypes of the evolutionary system encode the amplitude spectrum of candidates for testing stimuli by means of rectangle frequency windows with amplitudes determined evolutionarily.
Źródło:
Metrology and Measurement Systems; 2012, 19, 1; 73-84
0860-8229
Pojawia się w:
Metrology and Measurement Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient approach for view selection for data warehouse using tree mining and evolutionary computation
Autorzy:
Thakare, A.
Deshpande, P.
Powiązania:
https://bibliotekanauki.pl/articles/305413.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
database management systems
data warehousing and data mining
query optimization
graph mining
algorithms for parallel computing
evolutionary computations
genetic algorithms
Opis:
The selection of a proper set of views to materialize plays an important role in database performance. There are many methods of view selection that use different techniques and frameworks to select an efficient set of views for materialization. In this paper, we present a new efficient scalable method for view selection under the given storage constraints using a tree mining approach and evolutionary optimization. The tree mining algorithm is designed to determine the exact frequency of (sub)queries in the historical SQL dataset. The Query Cost model achieves the objective of maximizing the performance benefits from the final view set that is derived from the frequent view set given by the tree mining algorithm. The performance benefit of a query is defined as a function of query frequency, query creation cost, and query maintenance cost. The experimental results show that the proposed method is successful in recommending a solution that is fairly close to an optimal solution.
Źródło:
Computer Science; 2018, 19 (4); 431-455
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Niching mechanisms in evolutionary computations
Autorzy:
Kowalczuk, Z.
Białaszewski, T.
Powiązania:
https://bibliotekanauki.pl/articles/908461.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm genetyczny
projektowanie inżynierskie
obliczenia ewolucyjne
obserwator detekcyjny
niching
ranking
Pareto optimality
genetic algorithms
evolutionary computations
multi-objective optimisation
solutions diversity
engineering designs
detection observers
Opis:
Different types of niching can be used in genetic algorithms (GAs) or evolutionary computations (ECs) to sustain the diversity of the sought optimal solutions and to increase the effectiveness of evolutionary multi-objective optimization solvers. In this paper four schemes of niching are proposed, which are also considered in two versions with respect to the method of invoking: a continuous realization and a periodic one. The characteristics of these mechanisms are discussed, while as their performance and effectiveness are analyzed by considering exemplary multi-objective optimization tasks both of a synthetic and an engineering (FDI) design nature.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 1; 59-84
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Handling fuzzy systems’ accuracy-interpretability trade-off by means of multi-objective evolutionary optimization methods – selected problems
Autorzy:
Gorzałczany, M. B.
Rudziński, F.
Powiązania:
https://bibliotekanauki.pl/articles/199824.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
accuracy and interpretability of fuzzy rule-based systems
multi-objective evolutionary optimization
genetic computations
fuzzy systems
dokładność systemów rozmytych
optymalizacja
obliczenia genetyczne
systemy rozmyte
Opis:
The paper addresses several open problems regarding the automatic design of fuzzy rule-based systems (FRBSs) from data using multi-objective evolutionary optimization algorithms (MOEOAs). In particular, we propose: a) new complexity-related interpretability measure, b) efficient strong-fuzzy-partition implementation for improving semantics-related interpretability, c) special-coding-free implementation of rule base and original genetic operators for its processing, and d) implementation of our ideas in the context of well-known MOEOAs such as SPEA2 and NSGA-II. The experiments demonstrate that our approach is an effective tool for handling FRBSs’ accuracy-interpretability trade-off, i.e, designing FRBSs characterized by various levels of such a trade-off (in particular, for designing highly interpretability-oriented systems of still competitive accuracy).
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 3; 791-798
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    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