Sciweavers

AUSAI
2015
Springer

Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search

7 years 11 months ago
Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search
Abstract. The algorithm selection problem asks to select the best algorithm for a given problem. In the companion paper Everitt and Hutter (2015b), expected BFS and DFS tree search runtime was approximated as a function of tree depth and probabilistic goal distribution. Here we provide an analogous analysis of BFS and DFS graph search, deriving expected runtime as a function of graph structure and goal distribution. The applicability of the method is demonstrated through analysis of two different grammar problems. The approximations come surprisingly close to empirical reality.
Tom Everitt, Marcus Hutter
Added 16 Apr 2016
Updated 16 Apr 2016
Type Journal
Year 2015
Where AUSAI
Authors Tom Everitt, Marcus Hutter
Comments (0)