A Generic Approach for Accelerating Belief Propagation based DCOP Algorithms via A Branch-and-Bound Technique.
Ziyu ChenXingqiong JiangYanchen DengDingding ChenZhongshi HePublished in: CoRR (2019)
Keyphrases
- belief propagation
- branch and bound
- bnb adopt
- graphical models
- search algorithm
- message passing
- branch and bound algorithm
- lower bound
- distributed constraint optimization
- stereo matching
- graph cuts
- markov random field
- optimal solution
- search space
- column generation
- upper bound
- pairwise
- tree search
- branch and bound search
- combinatorial optimization
- approximate inference
- markov networks
- beam search
- energy function
- probabilistic inference
- distributed constraint optimization problems
- probabilistic model
- heuristic search
- max sat
- linear programming relaxation
- multi agent
- reinforcement learning
- linear programming
- mathematical model
- bayesian networks