An analysis of iterative-deepening-A* /
Iterative-deepening-A* (IDA*) is an admissible heuristic search algorithm which is optimal with respect to space complexity and the cost of solution found over the class of admissible best-first tree search algorithms. However, the optimality of IDA* with respect to time complexity is subject to a n...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
McGill University
1991
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=70298 |