156 search results - page 11 / 32 » Another Complete Local Search Method for SAT |
JAIR
2008
13 years 7 months ago
2008
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
IAT
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
IROS
2008
IEEE
14 years 1 months ago
2008
IEEE
— This article addresses the problem of autonomous map building and exploration of an unknown environment with mobile robots. The proposed method assumes that mobile robots use o...
AI
2005
Springer
13 years 7 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...