Skip Navigation

IEICE Transactions on Information and Systems 2008 E91-D(2):231-233; doi:10.1093/ietisy/e91-d.2.231
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by TU, R.
Right arrow Articles by ZHAO, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Special Section on Foundations of Computer Science -- Letters -- Algorithm Theory

Survey Propagation as "Probabilistic Token Passing"

Ronghui TU1, Yongyi MAO1 and Jiying ZHAO1

1 The authors are with the School of Information Technology and Engineering, University of Ottawa, 800 King Edward Ave., Ottawa, Ontario, Canada K1N 6N5. E-mail: rtu{at}site.uottawa.ca; yymao{at}site.uottawa.ca; jyzhao{at}site.uottawa.ca


  Abstract

In this paper, we present a clean and simple formulation of survey propagation (SP) for constraint-satisfaction problems as "probabilistic token passing". The result shows the importance of extending variable alphabets to their power sets in designing SP algorithms.

Key Words: constraint-satisfaction problem, survey propagation, graph coloring, message-passing

Manuscript received March 6, 2007.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.