Cartesian Genetic Programming
Created by W.Langdon from
gpbibliography.bib Revision:1.6149
 @InProceedings{Miller:2015:csdc,

author = "Julian Francis Miller",

title = "Cartesian Genetic Programming",

booktitle = "Complex Systems Digital Campus Econference,
CSDC'15",

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 = "http://csdc15.org/",

URL = "http://csdc15.org/papers/multiscaledynamics/evolcompmethods2/cartesiangeneticprogramming/",

abstract = "Cartesian Genetic Programming (CGP) is a form of
automatic program induction that uses an evolutionary
algorithm to evolve graphbased 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
design...).
Since its invention in 1999, it has been developed and
made more efficient in various ways. It can
automatically capture and evolve subfunctions (known
as modules) and through the introduction of
selfmodification operators it is possible to find
mathematically provable general solutions to classes of
problems. This talk is given by the inventor of the
technique.",

notes = "1 October 2015 7:40 to 8:10 (UTC) Evolutionary
Computing Methods session
Does not appear in proceedings published by Springer
2017",
 }
Genetic Programming entries for
Julian F Miller
Citations