90 search results - page 9 / 18 » Failure Analysis in Backtrack Search for Constraint Satisfac... |
FLAIRS
2007
14 years 11 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonall...
IJCAI
2003
14 years 10 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
107
click to vote
CONSTRAINTS
1998
14 years 9 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...