In this paper, we present a scheme where a local search algorithm, the breakout algorithm, is used to identify hard or unsolvable subproblems and to derive a ...

In this paper, we present a scheme where a local search algorithm, the breakout algorithm, is used to identify hard or unsolvable subproblems. This is used ...

In this paper, we present a scheme where a local search algorithm, the breakout algorithm, is used to identify hard or unsolvable subproblems. This is used in ...

Abstract. Local search algorithms have been very successful for solv- ing constraint satisfaction problems (CSP). However, a major weakness.

In this paper, we present a scheme where a local search algorithm, the breakout algorithm, is used to identify hard or unsolvable subproblems. This is used in ...

The weight information from the breakout algorithm can locate and order hard or unsolvable subprob- lems and guide backtracking by a fail-first variable order.

The breakout algorithm is used for identifying hard or unsolvable subproblems and the backtracking algorithm proves the solvability of these subproblems. The ...

The breakout algorithm is used for identifying hard or unsolvable subproblems and the backtracking algorithm proves the solvability of these subproblems. The ...

Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems. CP ... Making the Breakout Algorithm Complete Using Systematic Search. IJCAI ...

Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems · C. EisenbergB. Faltings. Computer Science, Mathematics. CP. 2003. TLDR. This paper ...