835 search results - page 8 / 167 » Dynamic populations in genetic algorithms |
GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
15 years 2 months ago
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
112
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...
AIPRF
2007
14 years 11 months ago
2007
This article presents an empirical study regarding the hypothesis that higher diversity in initial populations for Genetic Algorithms can reduce the number of iterations required ...
110
click to vote
GEM
2007
14 years 11 months ago
2007
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...