193 search results - page 21 / 39 » A Tractable Class of Abduction Problems |
ICDT
2010
ACM
15 years 25 days ago
2010
ACM
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
ICDT
2010
ACM
14 years 12 months ago
2010
ACM
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
NIPS
2003
14 years 11 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...