Relax, compensate and then recover: a theory of anytime, approximate inference

Authors:
Adnan Darwiche
Affiliations:
Computer Science Department, University of California, Los Angeles
Venue:
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Year:
2010

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Mini-buckets: A general scheme for bounded inference

Journal of the ACM (JACM)
Understanding belief propagation and its generalizations

Exploring artificial intelligence in the new millennium
An edge deletion semantics for belief propagation and its practical impact on approximation quality

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Focusing generalizations of belief propagation on targeted queries

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
A knowledge compilation map

Journal of Artificial Intelligence Research
Structural relaxations by variable renaming and their compilation for solving MinCostSAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Approximating weighted Max-SAT problems by compensating for relaxations

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming

Hi-index	0.00