Sciweavers

123 search results - page 3 / 25
» A new crossover technique for Cartesian genetic programming
Sort
View
EUROGP
2003
Springer
119views Optimization» more  EUROGP 2003»
14 years 20 days ago
Maximum Homologous Crossover for Linear Genetic Programming
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar struc...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...
GECCO
2004
Springer
14 years 25 days ago
Memetic Crossover for Genetic Programming: Evolution Through Imitation
For problems where the evaluation of an individual is the dominant factor in the total computation time of the evolutionary process, minimizing the number of evaluations becomes cr...
Brent E. Eskridge, Dean F. Hougen
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
14 years 29 days ago
Investigating the performance of module acquisition in cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...
James Alfred Walker, Julian Francis Miller
EUROGP
2006
Springer
136views Optimization» more  EUROGP 2006»
13 years 11 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...
CEC
2005
IEEE
13 years 9 months ago
Rank and proximity based crossover (RPC) to improve convergence in genetic search
A new crossover technique, we named Rank and Proximity Based Crossover (RPC), to improve the speed and quality of solutions in Genetic search, is proposed. In the proposed strategy...
Goutam Chakraborty, Basabi Chakraborty