Sciweavers

835 search results - page 16 / 167
» Dynamic populations in genetic algorithms
Sort
View
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
14 years 10 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
GECCO
2003
Springer
15 years 2 months ago
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the po...
Kumara Sastry, David E. Goldberg
EUROGP
2006
Springer
136views Optimization» more  EUROGP 2006»
15 years 1 months ago
Using Subtree Crossover Distance to Investigate Genetic Programming Dynamics
Abstract. To analyse various properties of the search process of genetic programming it is useful to quantify the distance between two individuals. Using operator-based distance me...
Leonardo Vanneschi, Steven Gustafson, Giancarlo Ma...
BMCBI
2008
214views more  BMCBI 2008»
14 years 8 months ago
Enhanced Bayesian modelling in BAPS software for learning genetic structures of populations
Background: During the most recent decade many Bayesian statistical models and software for answering questions related to the genetic structure underlying population samples have...
Jukka Corander, Pekka Marttinen, Jukka Siré...
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
15 years 2 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