Cartesian Genetic Programming

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

  author =       "Julian Francis Miller",
  title =        "Cartesian Genetic Programming",
  booktitle =    "Complex Systems Digital Campus E-conference,
  year =         "2015",
  editor =       "Paul Bourgine and Pierre Collet",
  pages =        "Paper ID: 356",
  month =        sep # " 30-" # oct # " 1",
  note =         "Invited talk",
  keywords =     "genetic algorithms, genetic programming, Cartesian
                 Genetic Programming",
  URL =          "",
  URL =          "",
  abstract =     "Cartesian Genetic Programming (CGP) is a form of
                 automatic program induction that uses an evolutionary
                 algorithm to evolve graph-based representations of
                 computational structures. It is a highly flexible and
                 general technique that can find solutions in many
                 problem domains (e.g. neural networks, mathematical
                 equation induction, object recognition in images,
                 digital and analogue circuit design, algorithm

                 Since its invention in 1999, it has been developed and
                 made more efficient in various ways. It can
                 automatically capture and evolve sub-functions (known
                 as modules) and through the introduction of
                 self-modification operators it is possible to find
                 mathematically provable general solutions to classes of
                 problems. This talk is given by the inventor of the
  notes =        "1 October 2015 7:40 to 8:10 (UTC) Evolutionary
                 Computing Methods session

                 Does not appear in proceedings published by Springer

Genetic Programming entries for Julian F Miller