Knowledge versus search: a quantitative analysis using A*

DOI10.1016/0004-3702(83)90013-9zbMath0497.68036OpenAlexW1505609243MaRDI QIDQ1170890

Judea Pearl

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

zbMATH Keywords

average number of nodesm-ary tree with unit branch costspolynomial search complexity

Mathematics Subject Classification ID

Searching and sorting (68P10) Artificial intelligence (68T99)

Related Items (7)

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^*\) ⋮ Statistical heuristic search ⋮ Heuristic tree search with nonparametric statistical inference methods ⋮ COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS ⋮ Optimal matching of deformed patterns with positional influence

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Knowledge versus search: a quantitative analysis using A*