Neutrality and gradualism: encouraging exploration and exploitation simultaneously with Binary Decision Diagrams

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

@InProceedings{Downing:2006:CEC,

• author = "Richard M. Downing",
• title = "Neutrality and gradualism: encouraging exploration and exploitation simultaneously with Binary Decision Diagrams",
• booktitle = "Proceedings of the 2006 IEEE Congress on Evolutionary Computation",
• year = "2006",
• pages = "615--622",
• address = "Vancouver",
• month = "16-21 " # jul,
• publisher = "IEEE Press",
• email = "rmd@cs.bham.ac.uk",
• keywords = "genetic algorithms, genetic programming",
• ISBN = "0-7803-9487-9",
• URL = "http://www.cs.bham.ac.uk/~rmd/pubs/gradualism.pdf",
• DOI = "doi:10.1109/CEC.2006.1688367",
• abstract = "Search algorithms are subject to the trappings of local optima. Attempts to address the problem are often framed in the context of needing to balance, or trade-off, exploitation against exploration. Ideally, it is best to maximise both simultaneously, but this is usually seen as infeasible in the presence of multi-modal search spaces. This paper investigates the potential for exploration of both neutrality and mutation rate, and argues that the former is the more important. The most interesting result, however, is that the necessity for a trade-off between exploitation and exploration can be avoided within the context of our algorithm for evolving Binary Decision Diagrams.",
• notes = "WCCI 2006 - A joint meeting of the IEEE, the EPS, and the IEE.",

}

Genetic Programming entries for Richard Mark Downing

Citations