Abstract
Previously, recombination (or crossover) has proved to be unbeneficial in Cartesian Genetic Programming (CGP). This paper describes the implementation of an implicit context representation for CGP in which the specific location of genes within the chromosome has no direct or indirect influence on the phenotype. Consequently, recombination has a beneficial effect and is shown to outperform conventional CGP in the even-3 parity problem. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Cai, X., Smith, S. L., & Tyrrell, A. M. (2006). Positional independence and recombination in cartesian genetic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3905 LNCS, pp. 351–360). Springer Verlag. https://doi.org/10.1007/11729976_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
