This paper analyzes the complexity of heuristic search algorithms, Le. algorithms which find the shortest path in a graph by using an estimate to guide the search. In particular, .algorithm A\*, due to Hart, Nilsson and Raphael, is shown to require 0(2 ~) steps, in the worst cdse, for searching a gr
The Complexity and Effectiveness of Prediction Algorithms
โ Scribed by Boris Ya. Ryabko
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 523 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of globa
We study generalizations of classical multifacility location problems, where customers' demand has a hierarchial structure, i.e., the set of local customers is partitioned into categories (global customers), each having its own requirements for quality of service. For the case of identical facilitie
Ah&&-The need to produce a simple but accurate model for determining the effectiveness factors and selectivities for complex reaction schemes has led many authors to make convenient but arbitrary simplifying assumptions in the formulation of their models. No systematic evaluation of these assumption