Sciweavers

470 search results - page 69 / 94
» Tabu Search for SAT
Sort
View
SARA
2007
Springer
14 years 1 months ago
A Meta-CSP Model for Optimal Planning
One approach to optimal planning is to first start with a sub- optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an...
Peter Gregory, Derek Long, Maria Fox
AIPS
2000
13 years 9 months ago
DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
Marco Baioletti, Stefano Marcugini, Alfredo Milani
EOR
2006
135views more  EOR 2006»
13 years 7 months ago
Principles of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
Rafael Martí, Manuel Laguna, Fred Glover
CPAIOR
2005
Springer
14 years 1 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker
CSR
2010
Springer
14 years 15 days ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning