IEICE TRANSACTIONS on Information
Survey Propagation as "Probabilistic Token Passing"
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E91-D No.2 pp.231-233
- Publication Date
- 2008/02/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1093/ietisy/e91-d.2.231
- Type of Manuscript
- Special Section LETTER (Special Section on Foundations of Computer Science)
- Category
- Algorithm Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ronghui TU, Yongyi MAO, Jiying ZHAO, "Survey Propagation as "Probabilistic Token Passing"" in IEICE TRANSACTIONS on Information,
vol. E91-D, no. 2, pp. 231-233, February 2008, doi: 10.1093/ietisy/e91-d.2.231.
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.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.2.231/_p
Copy
@ARTICLE{e91-d_2_231,
author={Ronghui TU, Yongyi MAO, Jiying ZHAO, },
journal={IEICE TRANSACTIONS on Information},
title={Survey Propagation as "Probabilistic Token Passing"},
year={2008},
volume={E91-D},
number={2},
pages={231-233},
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.},
keywords={},
doi={10.1093/ietisy/e91-d.2.231},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - Survey Propagation as "Probabilistic Token Passing"
T2 - IEICE TRANSACTIONS on Information
SP - 231
EP - 233
AU - Ronghui TU
AU - Yongyi MAO
AU - Jiying ZHAO
PY - 2008
DO - 10.1093/ietisy/e91-d.2.231
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E91-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2008
AB - 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.
ER -
English
