Relaxed survey propagation: A sum-product algorithm for max-SAT
Proceedings of the National Conference on Artificial Intelligence
Saved in:
Main Authors: | Chieu, H.L., Lee, W.S. |
---|---|
其他作者: | COMPUTER SCIENCE |
格式: | Conference or Workshop Item |
出版: |
2013
|
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/41604 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Relaxed survey propagation for the weighted maximum satisfiability problem
由: Chieu, H.L., et al.
出版: (2013) -
Cooled and relaxed survey propagation for MRFs
由: Chieu, H.L., et al.
出版: (2013) -
A fast exponential time algorithm for Max hamming distance X3SAT
由: Hoi, G, et al.
出版: (2023) -
On solving the partial MAX-SAT problem
由: Fu, Z., et al.
出版: (2013) -
Iterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channels
由: Dai, Lin
出版: (2012)