Parallel Heuristic Search: Algorithms, Analysis and Applications - Part III

algorithms based on traversing large implicitly defined trees by
backtracking and related methods. There are many applications of this
principle in AI, Operations Research, theorem proving, parallel
functional and logical programming languages and discrete mathematics.
The emphasis is on provably efficient load balancing algorithms for
very irregular and almost completely unpredictable computations which
are typical for these applications.

Part III: Further Issues
- Lower Bounds
- Implementing a Portable and Reusable Library
- Benchmark Applications
- Measurements
- Generalizing the Model:
* Subproblem Dependencies
* Best First Branch-and-Bound
* Game Tree Search