Pages that link to "Item:Q1146526"

The following pages link to Probabilistic analysis of the complexity of A* (Q1146526):

Displaying 8 items.

• Refinements to depth-first iterative-deepening search in automatic theorem proving (Q582116) (← links)
• A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm (Q761039) (← links)
• Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
• Knowledge versus search: a quantitative analysis using A* (Q1170890) (← links)
• New approaches for understanding the asymptotic complexity of \(A^*\) tree searching. (Q1354031) (← links)
• The mathematical modeling of heuristics. (Q1354035) (← links)
• An upper bound on the time complexity of iterative-deepening-\(A^*\) (Q1354042) (← links)
• Heuristic tree search with nonparametric statistical inference methods (Q3210918) (← links)