749 search results - page 28 / 150 » Dualities for Constraint Satisfaction Problems |
153
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
182
click to vote
ICDCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
149
click to vote
CCS
2001
ACM
15 years 10 months ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.