559 search results - page 74 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
123
Voted
SCP
1998
15 years 2 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
113
Voted
CP
1995
Springer
15 years 6 months ago
1995
Springer
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
117
Voted
IJCAI
2007
15 years 4 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
136
Voted
CP
2008
Springer
15 years 4 months ago
2008
Springer
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
125
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...