90 search results - page 4 / 18 » Failure Analysis in Backtrack Search for Constraint Satisfac... |
IJCAI
2001
13 years 8 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
CP
2005
Springer
14 years 20 days 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...
AAAI
2006
13 years 8 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
AI
2003
Springer
14 years 11 days ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...