Name
Title | ||
|---|---|---|
Solving Highly Cyclic Distributed Optimization Problems Without Busting the Bank: A Decimation-based Approach. |
Abstract | ||
|---|---|---|
In the context of solving large distributed constraint optimization problems, belief-propagation and incomplete inference algorithms are candidates of choice. However, in general, when the problem structure is very cyclic, these solution methods suffer from bad performance, due to non-convergence and many exchanged messages. As to improve performances of the MaxSum inference algorithm when solving... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1093/jigpal/jzaa069 | Logic Journal of the IGPL |
Keywords | DocType | Volume |
Distributed constrained optimization,DCOP,decimation,belief propagation | Journal | 29 |
Issue | ISSN | Citations |
1 | 1367-0751 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jesús Cerquides | 1 | 0 | 0.34 |
| Juan Antonio Rodríguez-Aguilar | 2 | 0 | 0.34 |
| Remi Emonet | 3 | 103 | 8.49 |
| Gauthier Picard | 4 | 0 | 0.34 |