Self Modifying Cartesian Genetic Programming: Parity
Created by W.Langdon from
gp-bibliography.bib Revision:1.6628
- @InProceedings{Harding:2009:cec,
-
author = "S. Harding and J. F. Miller and W. Banzhaf",
-
title = "Self Modifying Cartesian Genetic Programming: Parity",
-
booktitle = "2009 IEEE Congress on Evolutionary Computation",
-
year = "2009",
-
editor = "Andy Tyrrell",
-
pages = "285--292",
-
address = "Trondheim, Norway",
-
month = "18-21 " # may,
-
organization = "IEEE Computational Intelligence Society",
-
publisher = "IEEE Press",
-
isbn13 = "978-1-4244-2959-2",
-
file = "P128.pdf",
-
DOI = "
doi:10.1109/CEC.2009.4982960",
-
abstract = "Self Modifying CGP (SMCGP) is a developmental form of
Cartesian Genetic Programming(CGP). It differs from CGP
by including primitive functions which modify the
program. Beginning with the evolved genotype the
self-modifying functions produce a new program
(phenotype) at each iteration. In this paper we have
applied it to a well known digital circuit building
problem: even-parity. We show that it is easier to
solve difficult parity problems with SMCGP than either
with CGP or Modular CGP, and that the increase in
efficiency grows with problem size. More importantly,
we prove that SMCGP can evolve general solutions to
arbitrary-sized even parity problems.",
-
keywords = "genetic algorithms, genetic programming, cartesian
genetic programming",
-
notes = "CEC 2009 - A joint meeting of the IEEE, the EPS and
the IET. IEEE Catalog Number: CFP09ICE-CDR",
- }
Genetic Programming entries for
Simon Harding
Julian F Miller
Wolfgang Banzhaf
Citations