Looking ahead during search is often useful when solving constraint satisfaction problems. Previous studies have shown that looking ahead helps by causing dead-ends to occur earlier in the search,â€¦ (More)

The paper evaluates the e ectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and powerful variant ofâ€¦ (More)

We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instances with givenâ€¦ (More)

We present empirical evidence that the distribution of eeort required to solve CSPs randomly generated at the 50% satissable point, when using a backtracking algorithm, can be approximated by twoâ€¦ (More)

Over the past twenty ve years many backtracking algorithms have been developed for constraint satisfaction problems This survey describes the basic backtrack search within the search space frameworkâ€¦ (More)

We analyze the distribution of computational eeort required by backtracking algorithms on unsatissable CSPs, using analogies with reliability models, where lifetime of a specimen before failureâ€¦ (More)

A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these problems can be castâ€¦ (More)

The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the electric powerâ€¦ (More)

Over the past twenty years a number of backtracking algorithms for constraint satisfaction problems have been developed. This survey describes the basic backtrack search within the search spaceâ€¦ (More)