717 search results - page 7 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
CP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
WSTST
2005
Springer
15 years 3 months ago
2005
Springer
AAAI
1990
14 years 11 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
AAAI
2007
15 years 1 days ago
2007
Solving logic puzzles has become a very popular past-time, particularly since the Sudoku puzzle started appearing in newspapers all over the world. We have developed a puzzle gene...