Survey Propagation as 'Probabilistic Token Passing'
| Autor: | Jiying Zhao, Ronghui Tu, Yongyi Mao |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Theoretical computer science
Message passing Probabilistic logic Constraint satisfaction Power set Variable (computer science) Token passing Artificial Intelligence Hardware and Architecture Algorithmics Computer Vision and Pattern Recognition Electrical and Electronic Engineering Algorithm Software Constraint satisfaction problem Mathematics |
| Zdroj: | IEICE Transactions on Information and Systems. :231-233 |
| ISSN: | 1745-1361 0916-8532 |
| DOI: | 10.1093/ietisy/e91-d.2.231 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|