منابع مشابه
Genetic Algorithms in Noisy Environments
Genetic Algorithms (GA) have been widely used in the areas of searching, function optimization, and machine learning. In many of these applications, the effect of noise is a critical factor in the performance of the genetic algorithms. While it hals been shown in previous siiudies that genetic algorithms are still able to perform effective121 in the presence of noise, tlhe problem of locating t...
متن کاملBenefits of Implicit Redundant Genetic Algorithms for Structural Damage Detection in Noisy Environments
A robust structural damage detection method that can handle noisy frequency response function information is discussed. The inherent unstructured nature of damage detection problems is exploited by applying an implicit redundant representation (IRR) genetic algorithm. The unbraced frame structure results obtained show that the IRR GA is less sensitive to noise than a SGA. 1 Unstructured Problem...
متن کاملAnalysis of Acoustic Feature Extraction Algorithms in Noisy Environments
Acoustic feature extraction algorithms play a central role in many speech and music processing applications. However, noise usually prevents acoustic feature extraction algorithms from obtaining the correct information from speech and music signals. Thus, the robustness of acoustic feature extraction algorithms is an area worth studying. In this thesis, we consider two important acoustic featur...
متن کاملGenetic Algorithms for Changing Environments
Genetic algorithms perform an adaptive search by maintaining a population of candidate solutions that are allocated dynamically to promising regions of the search space. The distributed nature of the genetic search provides a natural source of power for searching in changing environments. As long as sufficient diversity remains in the population the genetic algorithm can respond to a changing r...
متن کاملGenetic Algorithms in Time-Dependent Environments
The influence of time-dependent fitnesses on the infinite population dynamics of simple genetic algorithms (without crossover) is analyzed. Based on general arguments, a schematic phase diagram is constructed that allows one to characterize the asymptotic states in dependence on the mutation rate and the time scale of changes. Furthermore, the notion of regular changes is raised for which the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 1988
ISSN: 0885-6125,1573-0565
DOI: 10.1007/bf00113893