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. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/41604 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Relaxed survey propagation for the weighted maximum satisfiability problem
by: Chieu, H.L., et al.
Published: (2013) -
Cooled and relaxed survey propagation for MRFs
by: Chieu, H.L., et al.
Published: (2013) -
A fast exponential time algorithm for Max hamming distance X3SAT
by: Hoi, G, et al.
Published: (2023) -
On solving the partial MAX-SAT problem
by: Fu, Z., et al.
Published: (2013) -
Iterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channels
by: Dai, Lin
Published: (2012)