Cost-error relationships in A* tree-searching

DOI10.1145/77600.77595MaRDI QIDQ3474277zbMATH OpenOpenAlexFDO

Authors Henry W. Davis

Publication date 1990

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/77600.77595

zbMATH Keywords

graph and tree search strategiesheuristic methods

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On the cost of unsuccessful searches in search trees with two-way comparisons
• New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.
• On the tree search problem with non-uniform costs
• On the tree search problem with non-uniform costs
• Search cost for a nearly optimal path in a binary tree
• Expected Costs in Some Classes of Binary Search Trees
• scientific article; zbMATH DE number 3868632
• Publication:3469112
• On the complexity of searching in trees: average-case minimization
• scientific article; zbMATH DE number 2011834

Cited in

(4)

• New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.
• The comparison between the statistical heuristic search and \(A^*\)
• scientific article; zbMATH DE number 4131689 (Why is no real title available?)
• Average-case analysis of best-first search in two representative directed acyclic graphs

This page was built for publication: Cost-error relationships in A* tree-searching

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