191 search results - page 16 / 39 » Reformulating Constraint Satisfaction Problems to Improve Sc... |
CP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
AAAI
1996
13 years 9 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
AAAI
1994
13 years 9 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
IJCAI
1993
13 years 9 months ago
1993
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can dete...
JAL
2008
13 years 7 months ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...