434 search results - page 19 / 87 » Constraint-Based Combinators for Local Search |
130
click to vote
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
139
click to vote
FROCOS
2009
Springer
15 years 9 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
135
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The AI optimization algorithm called "Squeaky-Wheel Optimization" (SWO) has proven very effective in a variety of real-world applications. Although the ideas behind SWO ...
118
Voted
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
135
click to vote
ASE
2006
15 years 5 months ago
2006
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...