717 search results - page 77 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
AMT
2009
Springer
15 years 4 months ago
2009
Springer
Considering the time constraints and Web scale data, it is impossible to achieve absolutely complete reasoning results. Plus, the same results may not meet the diversity of user ne...
IAT
2006
IEEE
15 years 3 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...
CP
2003
Springer
15 years 3 months ago
2003
Springer
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...
APLAS
2000
ACM
15 years 2 months ago
2000
ACM
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
SETN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...