scientific article; zbMATH DE number 67463

MaRDI QIDQ4012190zbMATH OpenFDO

Authors Stephen V. Chenoweth, Henry W. Davis

Publication date 27 September 1992

zbMATH Keywords

heuristicsrandom variableshigh-performance \(A^*\) search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• The mathematical modeling of heuristics.
• New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.
• The time complexity of \(A^*\) with approximate heuristics on multiple-solution search spaces
• A result on the computational complexity of heuristic estimates for the A^* algorithm
• Generalized best-first search strategies and the optimality of A*

Cited in

(8)

• Learning for efficient search
• Heuristic Hill-Climbing as a Markov Process
• Predicting the performance of IDA\(^*\) using conditional distributions
• Average-case analysis of best-first search in two representative directed acyclic graphs
• D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
• Predicting optimal solution cost with conditional probabilities
• Time complexity of \(A^{**}\)
• The time complexity of \(A^*\) with approximate heuristics on multiple-solution search spaces

This page was built for publication:

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