#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1992

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Daniel Frost, Rina Dechter
- IJCAI
- 1995

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, and by providing information that is useful for dynamic variable ordering. In this paper, we show that another benefit of looking ahead is a useful domain value… (More)

- Daniel Frost, Rina Dechter
- AAAI
- 1994

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 learning and by presenting an extensive empirical study on much larger and more di cult problem instances. Our results show that learning can speed up… (More)

- Daniel Frost, Rina Dechter
- AAAI
- 1994

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 characteristics, we show how the relative performance of various search methods varies with the number of variables, the tightness of the constraints, and the… (More)

- Rina Dechter, Daniel Frost
- Artif. Intell.
- 2002

- Daniel Frost, Irina Rish, Lluís Vila
- AAAI/IAAI
- 1997

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 standard families of continuous probability distribution functions. Solvable problems can be modelled by the Weibull distribution , and unsolvable problems by the… (More)

- Rina Dechter, Daniel Frost
- 1998

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 and then presents a number of improvements developed in the past two decades including look back methods such as backjumping constraint recording backmarking… (More)

- Irina Rish, Daniel Frost
- CP
- 1997

Abs t r ac t . We analyze the distribution of computational effort required by backtracking algorithms on unsatisfiable CSPs, using analogies with reliability models, where lifetime of a specimen before failure corresponds to the runtime of backtracking on unsatisfiable CSPs. We extend the results of [7] by showing empirically that the lognormal… (More)

- Daniel Frost, Rina Dechter
- CP
- 1998

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 as constraint satisfaction problems and provide an \iterative learning" algorithm which solves the problem in the following manner. In order to nd an optimal… (More)

- Daniel Frost, Rina Dechter
- Annals of Mathematics and Artificial Intelligence
- 1999

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 industry: optimally scheduling preventive maintenance of power generating units within a power plant. We show how these scheduling problems can be cast as constraint… (More)

- Rina Dechter, Daniel Frost
- 1998

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 framework and then presents a number of improvements including look-back methods such as backjumping, constraint recording, backmarking, and look-ahead methods such… (More)