Beyond Uninformed Search: Improving Branch-and-bound Based Acceleration Algorithms for Belief Propagation via Heuristic Strategies.
Junsong GaoZiyu ChenDingding ChenWenxin ZhangPublished in: AAMAS (2022)
Keyphrases
- branch and bound
- search algorithm
- belief propagation
- search strategies
- branch and bound search
- tree search
- tree search algorithm
- beam search
- depth first search
- graphical models
- combinatorial optimization
- mini bucket
- search space
- partial solutions
- markov random field
- branch and bound algorithm
- lower bound
- loopy belief propagation
- search heuristics
- optimal solution
- column generation
- branch and bound method
- search strategy
- branch and bound procedure
- message passing
- approximate inference
- search methods
- fixed point
- stereo matching
- upper bound
- graph cuts
- max product
- computational complexity
- cost function