Cartesian Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8098
- @InCollection{Miller:2011:CGP.ch2,
-
author = "Julian F. Miller",
-
title = "Cartesian Genetic Programming",
-
booktitle = "Cartesian Genetic Programming",
-
publisher = "Springer",
-
editor = "Julian F. Miller",
-
year = "2011",
-
series = "Natural Computing Series",
-
chapter = "2",
-
pages = "17--34",
-
keywords = "genetic algorithms, genetic programming, Cartesian
Genetic Programming, (CGP)",
-
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_2",
-
abstract = "In this chapter, we describe the original and most
widely known form of Cartesian genetic programming
(CGP). CGP encodes computational structures, which we
call programs in the form of directed acyclic graphs.
We refer to this as classic CGP. However these program
may be computer programs, circuits, rules, or other
specialised computational entities.",
-
notes = "part of \cite{Miller:CGP}",
- }
Genetic Programming entries for
Julian F Miller
Citations