Survey Propagation as “Probabilistic Token Passing”

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

著者

• TU Ronghui

  School of Information Technology and Engineering, University of Ottawa

• MAO Yongyi

  School of Information Technology and Engineering, University of Ottawa

• ZHAO Jiying

  School of Information Technology and Engineering, University of Ottawa

関連論文

• Survey Propagation as “Probabilistic Token Passing”

スポンサーリンク