Sciweavers

151 search results - page 3 / 31
» Seeding Genetic Programming Populations
Sort
View
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
13 years 9 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
140views Optimization» more  GECCO 2004»
13 years 11 months ago
Keeping the Diversity with Small Populations Using Logic-Based Genetic Programming
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
Ken Taniguchi, Takao Terano
GECCO
2003
Springer
101views Optimization» more  GECCO 2003»
13 years 11 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
BMCBI
2008
149views more  BMCBI 2008»
13 years 6 months ago
Clustering of cognate proteins among distinct proteomes derived from multiple links to a single seed sequence
Background: Modern proteomes evolved by modification of pre-existing ones. It is extremely important to comparative biology that related proteins be identified as members of the s...
Adriano Barbosa-Silva, Venkata P. Satagopam, Reinh...
GECCO
2004
Springer
13 years 11 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