Publication detail

When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?

GAJDA, Z. SEKANINA, L.

Original Title

When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?

Type

article in a collection out of WoS and Scopus

Language

English

Original 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.

Keywords

genetic programming, digital circuits, evolutionary design

Authors

GAJDA, Z.; SEKANINA, L.

RIV year

2010

Released

8. 7. 2010

Publisher

Association for Computing Machinery

Location

New York

ISBN

978-1-4503-0072-8

Book

Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2010

Pages from

983

Pages to

984

Pages count

2

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"
}