714 search results - page 21 / 143 » Lexicographically-ordered constraint satisfaction problems |
CEEMAS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
JUCS
2007
14 years 9 months ago
2007
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
CSR
2010
Springer
15 years 2 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). ...
90
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
SOFSEM
2004
Springer
15 years 2 months ago
2004
Springer
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...