On the optimality of A∗
✍ Scribed by David Gelperin
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 438 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
✦ Synopsis
After discussing difficulties with previous proofs of A*'s ootimality, new proofs are presented. In addition, examples are used to show: (1) that the value of (~n) may be a function of the state of the search as well as the al~ailable heuristic information and ( 2) that there exist admissible search aloorithreu which can not be simulated by any A* algorithm.
📜 SIMILAR VOLUMES
## Abstract This note considers the hedging effectiveness of a dynamic hedge strategy as compared to the conventional OLS strategy. The conditions for the superiority of the OLS strategy are identified. It is argued that these conditions are frequently satisfied and therefore one expects to find th