201 search results - page 11 / 41 » New Structural Decomposition Techniques for Constraint Satis... |
128
click to vote
CP
2007
Springer
15 years 5 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
108
click to vote
TIME
2002
IEEE
15 years 4 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] ...
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
107
click to vote
SAGA
2001
Springer
15 years 4 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
102
click to vote
IAT
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...