Sciweavers

2 search results - page 1 / 1
» Using the Breakout Algorithm to Identify Hard and Unsolvable...
Sort
View
CP
2003
Springer
15 years 4 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. 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 de...
Carlos Eisenberg, Boi Faltings
107
Voted
IJCAI
2003
15 years 26 days ago
Making the Breakout Algorithm Complete Using Systematic Search
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...
Carlos Eisenberg, Boi Faltings