714 search results - page 127 / 143 » Lexicographically-ordered constraint satisfaction problems |
CP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
ATAL
2005
Springer
14 years 3 months ago
2005
Springer
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
CP
2010
Springer
13 years 8 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...