Self-modifying cartesian genetic programming

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

@InProceedings{1277161,
  author =       "Simon L. Harding and Julian F. Miller and 
                 Wolfgang Banzhaf",
  title =        "Self-modifying cartesian genetic programming",
  booktitle =    "GECCO '07: Proceedings of the 9th annual conference on
                 Genetic and evolutionary computation",
  year =         "2007",
  editor =       "Dirk Thierens and Hans-Georg Beyer and 
                 Josh Bongard and Jurgen Branke and John Andrew Clark and 
                 Dave Cliff and Clare Bates Congdon and Kalyanmoy Deb and 
                 Benjamin Doerr and Tim Kovacs and Sanjeev Kumar and 
                 Julian F. Miller and Jason Moore and Frank Neumann and 
                 Martin Pelikan and Riccardo Poli and Kumara Sastry and 
                 Kenneth Owen Stanley and Thomas Stutzle and 
                 Richard A Watson and Ingo Wegener",
  volume =       "1",
  isbn13 =       "978-1-59593-697-4",
  pages =        "1021--1028",
  address =      "London",
  URL =          "http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p1021.pdf",
  DOI =          "doi:10.1145/1276958.1277161",
  publisher =    "ACM Press",
  publisher_address = "New York, NY, USA",
  month =        "7-11 " # jul,
  organisation = "ACM SIGEVO (formerly ISGEC)",
  keywords =     "genetic algorithms, genetic programming, Cartesian
                 Genetic Programming, Generative and Developmental
                 Systems, evolution, self modification",
  abstract =     "In nature, systems with enormous numbers of components
                 (i.e. cells) are evolved from a relatively small
                 genotype. It has not yet been demonstrated that
                 artificial evolution is sufficient to make such a
                 system evolvable. Consequently researchers have been
                 investigating forms of computational development that
                 may allow more evolvable systems. The approaches taken
                 have largely used re-writing, multi-cellularity, or
                 genetic regulation. In many cases it has been difficult
                 to produce general purpose computation from such
                 systems. In this paper we introduce computational
                 development using a form of Cartesian Genetic
                 Programming that includes self-modification operations.
                 One advantage of this approach is that ab initio the
                 system can be used to solve computational problems. We
                 present results on a number of problems and demonstrate
                 the characteristics and advantages that
                 self-modification brings.",
  notes =        "GECCO-2007 A joint meeting of the sixteenth
                 international conference on genetic algorithms
                 (ICGA-2007) and the twelfth annual genetic programming
                 conference (GP-2007).

                 ACM Order Number 910071",
}

Genetic Programming entries for Simon Harding Julian F Miller Wolfgang Banzhaf

Citations