资源分类
》 资源 》论文》Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models

Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models

2020-02-04 | |  52 |   49 |   0

Abstract 

The paper presents and evaluates the power of parallel search for exact MAP inference in graphical models. We introduce a new parallel shared-memory recursive best-first AND/OR search algorithm, called SPRBFAOO, that explores the search space in a best-first manner while operating with restricted memory. Our experiments show that SPRBFAOO is often superior to the current state-of-the-art sequential AND/OR search approaches, leading to considerable speed-ups (up to 7-fold with 12 threads), especially on hard problem instances.

上一篇：A Market Framework for Eliciting Private Data

下一篇：A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice

用户评价
全部评价

热门资源

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

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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