- author = "Herman Ehrenburg",
- title = "Improved Directed Acyclic Graph Evaluation and the Combine Operator in Genetic Programming",
- booktitle = "Genetic Programming 1996: Proceedings of the First Annual Conference",
- editor = "John R. Koza and David E. Goldberg and David B. Fogel and Rick L. Riolo",
- year = "1996",
- month = "28--31 " # jul,
- keywords = "genetic algorithms, genetic programming, DAG",
- pages = "285--291",
- address = "Stanford University, CA, USA",
- publisher = "MIT Press",
- ISBN = "0-262-61127-9",
-
URL = "
http://cognet.mit.edu/sites/default/files/books/9780262315876/pdfs/9780262315876_chap36.pdf",
-
DOI = "
10.7551/mitpress/3242.001.0001",
- size = "6 pages",
- abstract = "The use of a directed acyclic graph (DAG) to represent a population in genetic programming offers several advantages, only one of which is the efficient use of space. We improve on existing methods to evaluate a DAG and offer two new ways of evaluating a population. The first method uses a linked list and a negligible amount of space. In the second method, each node is evaluated only once on all fitness cases and the results are cached. We also introduce two genetic operators in connection to the use of a DAG. The first is a simpler alternative to crossover. The second is a context-preserving genetic operators based on the building block hypothesis, which accurate combined two similar trees.",
-
notes = "GP-96
'combine' genetic operator, ancestor information.
p289 Does not 'make use of the 32-fold speedup be evaluating 32 fitness cases in parallel'. p290 'Martin C. Martin' 'CMU 32-parallelization trick'.",
