589 search results - page 22 / 118 » Local Search Algorithms for SAT: An Empirical Evaluation |
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
SAC
2004
ACM
14 years 25 days ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
CPAIOR
2005
Springer
14 years 28 days 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...