Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search
AI 2015: ADVANCES IN ARTIFICIAL INTELLIGENCE(2015)
摘要
The algorithm selection problem asks to select the best algorithm for a given problem. In the companion paper (Everitt and Hutter 2015b), expected runtime was approximated as a function of search depth and probabilistic goal distribution for tree search versions of breadth-first search (BFS) and depth-first search (DFS). 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.
更多查看译文
关键词
Algorithm Selection Problem, Graph Search, Grammar Problem, Distributional Goals, Hutter 2015b
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要