What Is Autonomous Search?

Youssef Hamadi (), Eric Monfroy and Frédéric Saubion
Additional contact information
Youssef Hamadi: Microsoft Research

A chapter in Hybrid Optimization, 2011, pp 357-391 from Springer

Abstract: Abstract Autonomous search is a particular case of adaptive systems that improve their solving performance by modifying and adjusting themselves to the problem at hand, either by self-adaptation or by supervised adaptation. We propose a general definition and a taxonomy of search processes with respect to their computation characteristics. For this purpose, we decompose solvers into components and their configurations. Some computation rules between computation stages are used to formalize the solver modifications and adaptations. Using these rules, we then sketch out and classify some well known solvers and try to answer the question: “What is Autonomous Search?”

Keywords: Local Search; Search Process; Constraint Programming; Local Search Algorithm; Tabu List (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4419-1644-0_11

Ordering information: This item can be ordered from
http://www.springer.com/9781441916440

DOI: 10.1007/978-1-4419-1644-0_11

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().