Publication Details

When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?

GAJDA, Z.; SEKANINA, L. When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?. Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2010. New York: Association for Computing Machinery, 2010. p. 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. (RG EHW)
Sekanina Lukáš, prof. Ing., Ph.D. (DCSY)

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

ISBN

978-1-4503-0072-8

Publisher

Association for Computing Machinery

Place

New York

BibTeX

@inproceedings{BUT35530,
  author="Zbyšek {Gajda} and Lukáš {Sekanina}",
  title="When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?",
  booktitle="Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2010",
  year="2010",
  pages="983--984",
  publisher="Association for Computing Machinery",
  address="New York",
  isbn="978-1-4503-0072-8"
}