Sciweavers

942 search results - page 20 / 189
» Distance Constraint Satisfaction Problems
Sort
View
JCSS
2008
107views more  JCSS 2008»
13 years 8 months ago
A unified theory of structural tractability for constraint satisfaction problems
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
David A. Cohen, Peter Jeavons, Marc Gyssens
SETN
2004
Springer
14 years 1 months ago
Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
George Boukeas, Panagiotis Stamatopoulos, Constant...
LICS
2007
IEEE
14 years 2 months ago
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...
László Egri, Benoit Larose, Pascal T...
CEEMAS
2005
Springer
14 years 2 months ago
On Communication in Solving Distributed Constraint Satisfaction Problems
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
Hyuckchul Jung, Milind Tambe
CSR
2010
Springer
14 years 1 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
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). ...
Uwe Schöning