201 search results - page 5 / 41 » New Structural Decomposition Techniques for Constraint Satis... |
109
click to vote
AUSAI
2003
Springer
15 years 4 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
105
Voted
JACM
2010
14 years 10 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...
106
click to vote
IJCAI
1989
15 years 24 days ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
121
click to vote
TEC
2002
14 years 11 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
100
click to vote
AAAI
1998
15 years 1 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...