When does Cartesian genetic programming minimize the phenotype size implicitly?

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Gajda:2010:gecco,

• author = "Zbysek Gajda and Lukas Sekanina",
• title = "When does Cartesian genetic programming minimize the phenotype size implicitly?",
• booktitle = "GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation",
• year = "2010",
• editor = "Juergen Branke and Martin Pelikan and Enrique Alba and Dirk V. Arnold and Josh Bongard and Anthony Brabazon and Juergen Branke and Martin V. Butz and Jeff Clune and Myra Cohen and Kalyanmoy Deb and Andries P Engelbrecht and Natalio Krasnogor and Julian F. Miller and Michael O'Neill and Kumara Sastry and Dirk Thierens and Jano {van Hemert} and Leonardo Vanneschi and Carsten Witt",
• isbn13 = "978-1-4503-0072-8",
• pages = "983--984",
• keywords = "genetic algorithms, genetic programming, Cartesian genetic programming, Poster",
• month = "7-11 " # jul,
• organisation = "SIGEVO",
• address = "Portland, Oregon, USA",
• DOI = "doi:10.1145/1830483.1830661",
• publisher = "ACM",
• publisher_address = "New York, NY, USA",
• abstract = "A new method is proposed to minimize the number of gates in combinational circuits using Cartesian Genetic Programming (CGP). We show that when the selection of the parent individual is performed on basis of its functionality solely (neglecting thus the phenotype size) smaller circuits can be evolved even if the number of gates is not considered by a fitness function. This phenomenon is confirmed on the evolutionary design of combinational multipliers.",
• notes = "Also known as \cite{1830661} GECCO-2010 A joint meeting of the nineteenth international conference on genetic algorithms (ICGA-2010) and the fifteenth annual genetic programming conference (GP-2010)",

}

Genetic Programming entries for Zbysek Gajda Lukas Sekanina

Citations