83 search results - page 3 / 17 » Variable size population for dynamic optimization with genet... |
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
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...
EUROGP
2000
Springer
13 years 10 months ago
2000
Springer
We show genetic programming (GP) populations can evolve under the influence of a Pareto multi-objective fitness and program size selection scheme, from "perfect" programs...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
CEC
2009
IEEE
14 years 1 months ago
2009
IEEE
— Genetic algorithms (GAs) have been argued to constitute a flexible search thereby enabling to solve difficult problems which classical optimization methodologies may find ha...
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...