Created by W.Langdon from gp-bibliography.bib Revision:1.7428
Cartesian Genetic Programming (CGP) \cite{miller:2000:CGP} is a relative new type of representation used in Evolutionary Computation (EC), and differs from the tree based representation in that outputs from previous computations can be reused. This is achieved by representing programs as directed acyclic graphs (DAGs), rather than as trees. Thus computations from subtrees can be reused to reduce the complexity of a function. We prove an analogous result to that in \cite{woodward:Modularity}; the complexity of a function using a (Cartesian Program) CP representation is invariant (up to an additive constant) when using different terminal sets, provided the different terminal sets can both be represented. This is essentially due to the fact that if a representation can express Automatic Reused Outputs \cite{miller:2000:CGP}, then it can effectively define its own terminals at a constant cost.",
Genetic Programming entries for John R Woodward