Evolving Binary Decision Diagrams using Implicit Neutrality

Created by W.Langdon from gp-bibliography.bib Revision:1.3973

@InProceedings{downing:2005:CEC,
  author =       "Richard Mark Downing",
  title =        "Evolving Binary Decision Diagrams using Implicit
                 Neutrality",
  booktitle =    "Proceedings of the 2005 IEEE Congress on Evolutionary
                 Computation",
  year =         "2005",
  editor =       "David Corne and Zbigniew Michalewicz and 
                 Marco Dorigo and Gusz Eiben and David Fogel and Carlos Fonseca and 
                 Garrison Greenwood and Tan Kay Chen and 
                 Guenther Raidl and Ali Zalzala and Simon Lucas and Ben Paechter and 
                 Jennifier Willies and Juan J. Merelo Guervos and 
                 Eugene Eberbach and Bob McKay and Alastair Channon and 
                 Ashutosh Tiwari and L. Gwenn Volkert and 
                 Dan Ashlock and Marc Schoenauer",
  volume =       "3",
  pages =        "2107--2113",
  address =      "Edinburgh, UK",
  publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ
                 08855-1331, USA",
  month =        "2-5 " # sep,
  organisation = "IEEE Computational Intelligence Society, Institution
                 of Electrical Engineers (IEE), Evolutionary Programming
                 Society (EPS)",
  publisher =    "IEEE Press",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-7803-9363-5",
  URL =          "http://www.cs.bham.ac.uk/~rmd/pubs/evolvingbddsCEC2005.pdf",
  DOI =          "doi:10.1109/CEC.2005.1554955",
  size =         "7 pages",
  abstract =     "A new algorithm is presented for evolving Binary
                 Decision Diagrams (BDD) that employs the neutrality
                 implicit in the BDD representation. It is shown that an
                 effortless neutral walk is taken; that is, a neutral
                 walk that requires no fitness evaluations. Experiments
                 show the algorithm to be robust and scalable across a
                 range of n-parity problems up to n = 17, and highly
                 efficient on a range of other functions with compact
                 BDD representations. Evolvability and modularity issues
                 are also discussed, and the search space is shown to be
                 free of local optima.",
  notes =        "CEC2005 - A joint meeting of the IEEE, the IEE, and
                 the EPS.

                 Sun, 18 Jun 2006 10:40:08 BST 20-mux and 17-parity.",
}

Genetic Programming entries for Richard Mark Downing

Citations