Detail publikace

When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?

Originální název

When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?

Anglický název

When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@inproceedings{BUT35530,
  author="Zbyšek {Gajda} and Lukáš {Sekanina}",
  title="When Does Cartesian Genetic Programming Minimize the Phenotype Size Implicitly?",
  annote="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.",
  address="Association for Computing Machinery",
  booktitle="Proceeding of Genetic and Evolutionary Computation Conference, GECCO 2010",
  chapter="35530",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Association for Computing Machinery",
  year="2010",
  month="july",
  pages="983--984",
  publisher="Association for Computing Machinery",
  type="conference paper"
}