scientific article; zbMATH DE number 67463

zbMATH Open0745.68102MaRDI QIDQ4012190FDOQ4012190

Authors: Stephen V. Chenoweth, Henry W. Davis 

Publication date: 27 September 1992

Title of this publication is not available (Why is that?)

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*

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (8)

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

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)