235 search results - page 18 / 47 » An efficient consistency algorithm for the Temporal Constrai... |
128
Voted
IJCAI
2007
15 years 5 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 ...
142
Voted
CP
2008
Springer
15 years 5 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...
133
Voted
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
133
Voted
CP
2005
Springer
15 years 9 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...
127
Voted
IJCAI
2007
15 years 5 months ago
2007
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...