Knowledge versus search: a quantitative analysis using A*

DOI10.1016/0004-3702(83)90013-9MaRDI QIDQ1170890zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• An admissible and optimal algorithm for searching AND/OR graphs
• Depth-m search in branch-and-bound algorithms
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3351222 (Why is no real title available?)
• On the complexity of admissible search algorithms
• On the optimality of A
• Probabilistic analysis of the complexity of A*
• Problem representations and formal properties of heuristic search
• The heuristic search under conditions of error

Cited in

(7)

• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1170890)