SearchSkip to Search Results
- 1Active Stratified Sampling
- 1Artificial Intelligence
- 1Heuristic Search
- 1Learning Heuristic Functions
- 1Optimal Solution Cost Prediction
Many important problems can be cast as state-space problems. In this dissertation we study a general paradigm for solving state-space problems which we name Cluster-and-Conquer (C&C). Algorithms that follow the C&C paradigm use the concept of equivalent states to reduce the number of states...