Message passing for task redistribution on sparse graphs

K. Y. Michael Wong, David Saad, Zhuo Gao

Research output: Contribution to conferencePaper

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 languageEnglish
Pages1-8
Number of pages8
Publication statusPublished - 23 Oct 2006
EventNeural Information Processing Systems 18 -
Duration: 23 Oct 200623 Oct 2006

Conference

ConferenceNeural Information Processing Systems 18
Period23/10/0623/10/06

Keywords

  • problem of resource allocation
  • sparse graphs with real variables
  • optimal resource allocation

Fingerprint Dive into the research topics of 'Message passing for task redistribution on sparse graphs'. Together they form a unique fingerprint.

  • Cite this

    Wong, K. Y. M., Saad, D., & Gao, Z. (2006). Message passing for task redistribution on sparse graphs. 1-8. Paper presented at Neural Information Processing Systems 18, . http://books.nips.cc/papers/files/nips18/NIPS2005_0386.pdf