Sciweavers

55 search results - page 3 / 11
» A Rigorous Evaluation of Crossover and Mutation in Genetic P...
Sort
View
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
14 years 1 months ago
A building-block royal road where crossover is provably essential
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
Richard A. Watson, Thomas Jansen
EUROGP
2001
Springer
106views Optimization» more  EUROGP 2001»
13 years 12 months ago
Linear-Tree GP and Its Comparison with Other GP Structures
Abstract. In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph stru...
Wolfgang Kantschik, Wolfgang Banzhaf
NCI
2003
107views Neural Networks» more  NCI 2003»
13 years 8 months ago
Sexual Selection with Competitive/Co-operative Operators for Genetic Algorithms
In a standard genetic algorithm (GA), individuals reproduce asexually: any two organisms may be parents in crossover. Gender separation and sexual selection here inspire a model o...
Jose Sánchez-Velazco, John A. Bullinaria
GECCO
2000
Springer
121views Optimization» more  GECCO 2000»
13 years 11 months ago
Informed operators: Speeding up genetic-algorithm-based design optimization using reduced models
In this paper we describe a method for improving genetic-algorithm-based optimization using informed genetic operators. The idea is to make the genetic operators such as mutation ...
Khaled Rasheed, Haym Hirsh
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
12 years 11 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin