417 search results - page 42 / 84 » In Search of the Best Constraint Satisfaction Search |
158
click to vote
CP
2007
Springer
16 years 9 days ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
177
click to vote
AI
1999
Springer
15 years 5 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
157
click to vote
IAT
2006
IEEE
16 years 5 days 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...
148
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
172
click to vote
SARA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...