Skip to main content
Article thumbnail
Location of Repository

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

By Richard M. Downing, School Of Computer Science and Uk Rmd@cs. Bham. Ac. Uk

Abstract

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. I

Publisher: IEEE Press
Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.4826
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.bham.ac.uk/~rmd/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.