On tree search algorithms

MaRDI QIDQ3170505zbMATH OpenFDO

Authors Maria Miroiu

Publication date 27 September 2011

zbMATH Keywords

exhaustive searchheuristic searchsearch problem

Mathematics Subject Classification ID

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

Recommendations

• The analysis of heuristics for search trees
• Performance of linear-space search algorithms
• Optimal Search on Some Game Trees
• Depth-first iterative-deepening: An optimal admissible tree search
• Space complexity of combinatorial search

Cited in

(8)

• The analysis of heuristics for search trees
• A study of search algorithms' optimization speed
• Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
• scientific article; zbMATH DE number 1864596 (Why is no real title available?)
• State-Space Search
• Subsumption algorithms based on search trees
• Competitive Online Search Trees on Trees
• The complexity of a simple stochastic OR-tree model in which ``directional search is bad

This page was built for publication: On tree search algorithms

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