Abstract
The problem of resource allocation in sparse graphs with real variables is studied using methods of statistical physics. An efficient distributed algorithm is devised on the basis of insight gained from the analysis and is examined using numerical simulations, showing excellent performance and full agreement with the theoretical results.
| Original language | English |
|---|---|
| Pages | 1-8 |
| Number of pages | 8 |
| Publication status | Published - 23 Oct 2006 |
| Event | Neural Information Processing Systems 18 - Duration: 23 Oct 2006 → 23 Oct 2006 |
Conference
| Conference | Neural Information Processing Systems 18 |
|---|---|
| Period | 23/10/06 → 23/10/06 |
Keywords
- problem of resource allocation
- sparse graphs with real variables
- optimal resource allocation