Self-Modifying Cartesian Genetic Programming

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

@InCollection{Harding:2011:CGP.ch4,
  author =       "Simon L. Harding and Julian F. Miller and 
                 Wolfgang Banzhaf",
  title =        "Self-Modifying Cartesian Genetic Programming",
  booktitle =    "Cartesian Genetic Programming",
  publisher =    "Springer",
  editor =       "Julian F. Miller",
  year =         "2011",
  series =       "Natural Computing Series",
  chapter =      "4",
  pages =        "101--124",
  keywords =     "genetic algorithms, genetic programming, Cartesian
                 Genetic Programming",
  isbn13 =       "978-3-642-17309-7",
  URL =          "http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-17309-7",
  DOI =          "doi:10.1007/978-3-642-17310-3_4",
  abstract =     "Self-modifying Cartesian genetic programming (SMCGP)
                 is a general purpose, graph-based, form of genetic
                 programming founded on Cartesian genetic programming.
                 In addition to the usual computational functions, it
                 includes functions that can modify the program encoded
                 in the genotype. SMCGP has high scalability in that
                 evolved programs encoded in the genotype can be
                 iterated to produce an infinite sequence of programs
                 (phenotypes). It also allows programs to acquire more
                 inputs and produce more outputs during iterations.
                 Another attractive feature of SMCGP is that it
                 facilitates the evolution of provably general solutions
                 to various computational problems.",
  notes =        "part of \cite{Miller:CGP}",
}

Genetic Programming entries for Simon Harding Julian F Miller Wolfgang Banzhaf

Citations