Improving Max-Sum through Decimation to Solve Loopy Distributed Constraint Optimization Problems

7 Jun 2017Jesús CerquidesRémi EmonetGauthier PicardJuan A. Rodríguez-Aguilar

In the context of solving large distributed constraint optimization problems (DCOP), belief-propagation and approximate inference algorithms are candidates of choice. However, in general, when the factor graph is very loopy (i.e. cyclic), these solution methods suffer from bad performance, due to non-convergence and many exchanged messages... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.