53 search results - page 11 / 11 » Exploiting the Constrainedness in Constraint Satisfaction Pr... |
SETN
2004
Springer
13 years 11 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...
DAC
2008
ACM
14 years 6 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
IAT
2006
IEEE
13 years 11 months ago
2006
IEEE
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...