466 search results - page 19 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
107
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
97
Voted
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
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...
117
click to vote
TAINN
2005
Springer
15 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
COR
2010
14 years 9 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...