Sciweavers

50 search results - page 1 / 10
» Genetic programming: optimal population sizes for varying co...
Sort
View
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
13 years 8 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
GECCO
2004
Springer
13 years 10 months ago
Virtual Ramping of Genetic Programming Populations
Abstract. Genetic Programming often uses excessive computational resources because the population size and the maximum number of generations per run are not optimized. We have deve...
Thomas Fernandez
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
13 years 9 months ago
Variable size population for dynamic optimization with genetic programming
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. pro...
Leonardo Vanneschi, Giuseppe Cuccu
FLAIRS
2006
13 years 6 months ago
Genetic Programming: Analysis of Optimal Mutation Rates in a Problem with Varying Difficulty
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
Alan Piszcz, Terence Soule
GECCO
2003
Springer
101views Optimization» more  GECCO 2003»
13 years 10 months ago
Population Implosion in Genetic Programming
With the exception of a small body of adaptive-parameter literature, evolutionary computation has traditionally favored keeping the population size constant through the course of t...
Sean Luke, Gabriel Catalin Balan, Liviu Panait