A Generic Approach to Accelerating Belief Propagation Based Incomplete Algorithms for DCOPs via a Branch-and-Bound Technique.
Ziyu ChenXingqiong JiangYanchen DengDingding ChenZhongshi HePublished in: AAAI (2019)
Keyphrases
- branch and bound
- belief propagation
- graphical models
- combinatorial optimization
- loopy belief propagation
- search algorithm
- message passing
- branch and bound algorithm
- markov random field
- lower bound
- upper bound
- graph cuts
- approximate inference
- search space
- distributed constraint optimization
- max product
- markov networks
- tree search
- branch and bound search
- optimization problems
- metaheuristic
- probabilistic model
- pairwise
- computational complexity
- belief networks
- stereo matching
- column generation
- image segmentation
- bnb adopt
- neural network