当前位置: X-MOL 学术IEEE Trans. Emerg. Top. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Warning Propagation Algorithm for the MAX-3-SAT Problem
IEEE Transactions on Emerging Topics in Computing ( IF 5.1 ) Pub Date : 2019-10-01 , DOI: 10.1109/tetc.2017.2736504
Xiaofeng Wang , Jiulei Jiang

Message propagation algorithms are widely used in approximate inference e.g. Cyber-Social Data Processing and Intelligence Mining. Especially, these algorithms enable hard region become narrower and thus they are very effective in solving satisfiability problems. Warning Propagation algorithm is one kind of basic message propagation algorithms. Based on this Warning Propagation algorithm, we designed a WPY algorithm to solve the MAX-3-SAT problem. We obtained a set of stable warning information, and the value of the partial variable is decided by using the stable set with high probability. Finally, the experiment results show that the WPY algorithm can effectively solve the random MAX-3-SAT instances.

中文翻译:

MAX-3-SAT问题的警告传播算法

消息传播算法广泛用于近似推理,例如网络社会数据处理和情报挖掘。特别是,这些算法使硬区域变得更窄,因此它们在解决可满足性问题方面非常有效。警告传播算法是一种基本的消息传播算法。基于这种警告传播算法,我们设计了 WPY 算法来解决 MAX-3-SAT 问题。我们得到了一组稳定的警告信息,利用高概率的稳定集来决定偏变量的取值。最后,实验结果表明WPY算法可以有效地解决随机MAX-3-SAT实例。
更新日期:2019-10-01
down
wechat
bug