Publication Details

When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?

GAJDA Zbyšek and SEKANINA Lukáš. When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?. In: Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2010. New York: Association for Computing Machinery, 2010, pp. 983-984. ISBN 978-1-4503-0072-8.
Czech title
Kdy kartézské genetické programování implicitně minimalizuje velikost fenotypu?
Type
conference paper
Language
english
Authors
Gajda Zbyšek, Ing., Ph.D. (DCSY FIT BUT)
Sekanina Lukáš, prof. Ing., Ph.D. (DCSY FIT BUT)
Keywords

genetic programming, digital circuits, evolutionary design

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.

Published
2010
Pages
983-984
Proceedings
Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2010
Conference
Genetic and Evolutionary Computations Conference 2010, Portland, US
ISBN
978-1-4503-0072-8
Publisher
Association for Computing Machinery
Place
New York, US
BibTeX 
@INPROCEEDINGS{FITPUB9249,
   author = "Zby\v{s}ek Gajda and Luk\'{a}\v{s} Sekanina",
   title = "When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?",
   pages = "983--984",
   booktitle = "Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2010",
   year = 2010,
   location = "New York, US",
   publisher = "Association for Computing Machinery",
   ISBN = "978-1-4503-0072-8",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/9249"
}
Back to top