Generalized Survey Propagation
Survey propagation (SP) has recently been discovered as an efficient algorithm in solving classes of hard constraint-satisfaction problems (CSP). Powerful as it is, SP is still a heuristic algorithm, and further understanding its algorithmic nature, improving its effectiveness and extending its appl...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
Université d'Ottawa / University of Ottawa
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/19972 http://dx.doi.org/10.20381/ruor-4586 |