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.

• （社）電子情報通信学会の論文
• 2008-02-01

著者

• Tu Ronghui

  The School Of Information Technology And Engineering University Of Ottawa

• MAO Yongyi

  the School of Information Technology and Engineering, University of Ottawa

• ZHAO Jiying

  the School of Information Technology and Engineering, University of Ottawa

• Mao Yongyi

  The School Of Information Technology And Engineering University Of Ottawa

• Zhao Jiying

  The School Of Information Technology And Engineering University Of Ottawa

関連論文

• Survey Propagation as "Probabilistic Token Passing"

スポンサーリンク