Knowledge versus search: a quantitative analysis using A*
From MaRDI portal
Publication:1170890
DOI10.1016/0004-3702(83)90013-9zbMath0497.68036MaRDI QIDQ1170890
Publication date: 1983
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(83)90013-9
Related Items
Statistical heuristic search, New approaches for understanding the asymptotic complexity of \(A^*\) tree searching., The mathematical modeling of heuristics., An upper bound on the time complexity of iterative-deepening-\(A^*\), Optimal matching of deformed patterns with positional influence, Heuristic tree search with nonparametric statistical inference methods, COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic analysis of the complexity of A*
- On the complexity of admissible search algorithms
- On the optimality of A
- Problem representations and formal properties of heuristic search
- The heuristic search under conditions of error
- An admissible and optimal algorithm for searching AND/OR graphs
- Depth-m search in branch-and-bound algorithms