1071 search results - page 29 / 215 » An Experimental Study of Benchmarking Functions for Genetic ... |
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
GECCO
2000
Springer
14 years 20 days ago
2000
Springer
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
GECCO
2006
Springer
14 years 22 days ago
2006
Springer
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
ECAL
1995
Springer
14 years 19 days ago
1995
Springer
In this paper we investigate the phenomenon of multi-parent reproduction, i.e. we study recombination mechanisms where an arbitrary n > 1 number of parents participate in creati...
EC
2008
13 years 9 months ago
2008
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants...