Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search
- 22 November 2015
- book chapter
- Published by Springer Nature
- p. 157-165
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search2015
- Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search2015
- Algorithm Selection for Combinatorial Search Problems: A SurveyAI Magazine, 2014
- Algorithm runtime prediction: Methods & evaluationArtificial Intelligence, 2014
- The Diameter of the Rubik's Cube Group Is TwentySIAM Journal on Discrete Mathematics, 2013
- Time complexity of iterative-deepening-A∗Artificial Intelligence, 2001
- Heuristic Sampling: A Method for Predicting the Performance of Tree Searching ProgramsSIAM Journal on Computing, 1992
- Tree Size by Partial BacktrackingSIAM Journal on Computing, 1978
- The Algorithm Selection Problem1976
- Estimating the efficiency of backtrack programsMathematics of Computation, 1975