- author = "Masayuki Yanagiya",
- title = "Efficient Genetic Programming Based on Binary Decision Diagrams",
- booktitle = "1995 IEEE Conference on Evolutionary Computation",
- year = "1995",
- volume = "1",
- pages = "234--239",
- address = "Perth, Australia",
- publisher_address = "Piscataway, NJ, USA",
- month = "29 " # nov # " - 1 " # dec,
- publisher = "IEEE Press",
- keywords = "genetic algorithms, genetic programming, Boolean functions, decision tables, Boolean functions, binary decision diagrams, data structure, directed acyclic graphs, genetic operations, isomorphic sub-graphs, 20-mux",
-
DOI = "
doi:10.1109/ICEC.1995.489151",
- size = "6 pages",
- abstract = "The performance of genetic programming can be dramatically improved by using a data structure coded by binary decision diagrams (BDDs). BDDs are a compact representation of Boolean functions using directed acyclic graphs. Efficient BDD-based crossover, mutation, and evaluation algorithms have been developed that allow all genetic operations to be performed on BDDs throughout the search. BDD-based GP reduces storage requirements by sharing isomorphic sub-graphs among individuals, and saves computational power by using a hash-based cache to make calculation more efficient. The proposed approach is powerful enough to solve the 20-multiplexer problem, which has never been reportedly achieved before.",
-
notes = "ICEC-95 Editors not given by IEEE, Organisers David
Fogel and Chris deSilva.
conference details at http://ciips.ee.uwa.edu.au/~dorota/icnn95.html
Also known as \cite{489151}. Reference corrected thanks to Colin G Johnson 12 May 2009",
