805 search results - page 49 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
174
click to vote
ICTAI
2009
IEEE
15 years 2 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
117
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
126
click to vote
SETN
2004
Springer
15 years 9 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...
130
click to vote
AAAI
1996
15 years 5 months ago
1996
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
266
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...