808 search results - page 17 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
131
Voted
CSCLP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
132
click to vote
AAAI
1998
15 years 5 months ago
1998
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
131
Voted
CEEMAS
2005
Springer
15 years 9 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...
114
Voted
SOFSEM
2004
Springer
15 years 9 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...
131
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...