资源分类
》 资源 》论文》Generalizing ADOPT and BnB-ADOPT

Generalizing ADOPT and BnB-ADOPT

2019-11-12 | |  44 |   40 |   0
Abstract ADOPT and BnB-ADOPT are two optimal DCOP search algorithms that are similar except for their search strat gies: the former uses best-?rst search and the latter use depth-?rst branch-and-bound search. In this paper, we present a new algorithm, called ADOPT(k), that generalizes them. Its behavior depends on the k parameter. It be haves like ADOPT when k = 1, like BnB-ADOPT when k = ? and like a hybrid of ADOPT and BnB-ADOPT when 1 < k < ?. We prove that ADOPT(k) is a correct and complete algorithm and experimentally show that ADOPT(k) outperforms ADOPT and BnB-ADOPT on several benchmarks across several metrics.

上一篇：A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas

下一篇：Dynamic SAT with Decision Change Costs: Formalization and Solutions Daisuke Hatano and Katsutoshi Hirayama

用户评价
全部评价

热门资源

  • 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...