71 search results - page 2 / 15 » On the Computation of Local Interchangeability in Discrete C... |
SAC
2000
ACM
13 years 9 months ago
2000
ACM
CSR
2010
Springer
13 years 10 months ago
2010
Springer
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). ...
FOCS
2009
IEEE
14 years 11 days ago
2009
IEEE
We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conje...
JACM
2010
13 years 4 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
TIME
2002
IEEE
13 years 10 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...