Sciweavers

117 search results - page 5 / 24
» Optimal Mutation Rates and Selection Pressure in Genetic Alg...
Sort
View
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
An analysis of constructive crossover and selection pressure in genetic programming
A common problem in genetic programming search algorithms is destructive crossover in which the offspring of good parents generally has worse performance than the parents. Design...
Huayang Xie, Mengjie Zhang, Peter Andreae
GECCO
2005
Springer
207views Optimization» more  GECCO 2005»
14 years 1 months ago
Adaptive crossover and mutation in genetic algorithms based on clustering technique
Instead of having fixed px and pm, this paper presents the use of fuzzy logic to adaptively tune px and pm for optimization of power electronic circuits throughout the process. By...
Jun Zhang, Henry Shu-Hung Chung, Jinghui Zhong
GECCO
2005
Springer
174views Optimization» more  GECCO 2005»
14 years 1 months ago
Diversity as a selection pressure in dynamic environments
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...
Lam Thu Bui, Jürgen Branke, Hussein A. Abbass
GECCO
2004
Springer
14 years 1 months ago
How to Overcome the Equivalent Mutant Problem and Achieve Tailored Selective Mutation Using Co-evolution
The use of Genetic Algorithms in evolution of mutants and test cases offers new possibilities in addressing some of the main problems of mutation testing. Most specifically the p...
Konstantinos Adamopoulos, Mark Harman, Robert M. H...
GECCO
2004
Springer
126views Optimization» more  GECCO 2004»
14 years 1 months ago
A Gene Based Adaptive Mutation Strategy for Genetic Algorithms
In this study, a new mechanism that adapts the mutation rate for each locus on the chromosomes, based on feedback obtained from the current population is proposed. Through tests us...
Sima Uyar, Sanem Sariel, Gülsen Eryigit