资源分类
》 资源 》论文》Predicting the Size of Depth-First Branch and Bound Search Trees Levi H. S. Lelis Lars Otten Rina Dechter

Predicting the Size of Depth-First Branch and Bound Search Trees Levi H. S. Lelis Lars Otten Rina Dechter

2019-11-11 | |  59 |   34 |   0
Abstract This paper provides algorithms for predicting the size of the Expanded Search Tree (EST ) of Depthfirst Branch and Bound algorithms (DFBnB) for optimization tasks. The prediction algorithm is implemented and evaluated in the context of solving combinatorial optimization problems over graphical models such as Bayesian and Markov networks. Our methods extend to DFBnB the approaches provided by Knuth-Chen schemes that were designed and applied for predicting the EST size of backtracking search algorithms. Our empirical results demonstrate good predictions which are superior to competing schemes.

上一篇：Double-Wheel Graphs Are Graceful

下一篇：Target-Value Search Revisited

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...