-
1
-
-
0021787868
-
Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey
-
Arnborg, S. A. 1985. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT 25:2-23.
-
(1985)
BIT
, vol.25
, pp. 2-23
-
-
Arnborg, S.A.1
-
2
-
-
0003265035
-
Tractable inference in complex stochastic processes
-
Boyen, X., and Koller, D. 1998. Tractable inference in complex stochastic processes. In Artificial Intelligence (UAI'98), 33-42.
-
(1998)
Artificial Intelligence (UAI'98)
, pp. 33-42
-
-
Boyen, X.1
Koller, D.2
-
3
-
-
0001249662
-
AIS-BN: An adaptive importance sampling algorithm for evidential reasoning in large bayesian networks
-
Cheng, J., and Druzdzel, M. 2000. AIS-BN: An adaptive importance sampling algorithm for evidential reasoning in large bayesian networks. Journal of Artificial Intelligence Research 13:155-188.
-
(2000)
Journal of Artificial Intelligence Research
, vol.13
, pp. 155-188
-
-
Cheng, J.1
Druzdzel, M.2
-
4
-
-
0025401005
-
The computational complexity of probabistic inferences
-
Cooper, G. 1990. The computational complexity of probabistic inferences. Artificial Intelligence 393-405.
-
(1990)
Artificial Intelligence
, pp. 393-405
-
-
Cooper, G.1
-
6
-
-
0001899541
-
A scheme for approximating probabilistic inference
-
Dechter, R., and Rish, I. 1997. A scheme for approximating probabilistic inference. In Artificial Intelligence (UAI'97), 132-141.
-
(1997)
Artificial Intelligence (UAI'97)
, pp. 132-141
-
-
Dechter, R.1
Rish, I.2
-
7
-
-
23044531596
-
A general scheme for multiple lower bound computation in constraint optimization
-
Dechter, R.; Kask, K.; and Larossa, J. 2001. A general scheme for multiple lower bound computation in constraint optimization. In Constraint Programming.
-
(2001)
Constraint Programming
-
-
Dechter, R.1
Kask, K.2
Larossa, J.3
-
9
-
-
0002251094
-
Bucket elimination: A unifying framework for probabilistic inference algorithms
-
Dechter, R. 1996. Bucket elimination: A unifying framework for probabilistic inference algorithms. In Uncertainty in Artificial Intelligence (UAI'96), 211-219.
-
(1996)
Uncertainty in Artificial Intelligence (UAI'96)
, pp. 211-219
-
-
Dechter, R.1
-
10
-
-
0003000434
-
A comparison of structural CSP decomposition methods
-
Gottlob, G.; Leone, N.; and Scarello, F. 1999. A comparison of structural CSP decomposition methods. IJCAI-99.
-
(1999)
IJCAI-99
-
-
Gottlob, G.1
Leone, N.2
Scarello, F.3
-
11
-
-
0038902663
-
-
Technical report, Department of Engineering and Public Policy, Carnegie Melon University
-
Henrion, M. 1986. Propagating uncertainty by logic sampling. In Technical report, Department of Engineering and Public Policy, Carnegie Melon University.
-
(1986)
Propagating Uncertainty by Logic Sampling
-
-
Henrion, M.1
-
13
-
-
0001698979
-
Bayesian updating in causal probabilistic networks by local computation
-
Jensen, F.; Lauritzen, S.; and Olesen, K. 1990. Bayesian updating in causal probabilistic networks by local computation. Computational Statistics Quarterly 4:269-282.
-
(1990)
Computational Statistics Quarterly
, vol.4
, pp. 269-282
-
-
Jensen, F.1
Lauritzen, S.2
Olesen, K.3
-
14
-
-
0012349395
-
-
Technical report, Ph.D. thesis, Information and Computer Science, University of California, Irvine
-
Kask, K. 2001. Approximation algorithms for graphical models. Technical report, Ph.D. thesis, Information and Computer Science, University of California, Irvine.
-
(2001)
Approximation Algorithms for Graphical Models
-
-
Kask, K.1
-
15
-
-
0038902662
-
Reduction of computational complexity in bayesian networks through removal of weak dependencies
-
Kjæaerulff, U. 1994. Reduction of computational complexity in bayesian networks through removal of weak dependencies. In Uncertainty in Artificial Intelligence (UAI'94).
-
(1994)
Uncertainty in Artificial Intelligence (UAI'94)
-
-
Kjæaerulff, U.1
-
17
-
-
0001006209
-
Local computation with probabilities on graphical structures and their application to expert systems
-
Lauritzen, S., and Spiegelhalter, D. 1988. Local computation with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B 50(2): 157-224.
-
(1988)
Journal of the Royal Statistical Society, Series B
, vol.50
, Issue.2
, pp. 157-224
-
-
Lauritzen, S.1
Spiegelhalter, D.2
-
20
-
-
0030120958
-
On the hardness of approximate reasoning
-
Roth, D. 1996. On the hardness of approximate reasoning. AI 82(1-2):273-302.
-
(1996)
AI
, vol.82
, Issue.1-2
, pp. 273-302
-
-
Roth, D.1
-
23
-
-
0012299065
-
Belief propagation and revision in networks with loops
-
Weiss, Y. 1997. Belief propagation and revision in networks with loops. In NIPS.
-
(1997)
NIPS
-
-
Weiss, Y.1
-
24
-
-
0012130564
-
Belief optimization for binary networks: A stable alternative to loopy belief propagation
-
Welling, M., and Teh, Y. 2001. Belief optimization for binary networks: A stable alternative to loopy belief propagation. In UAI'01, 554-561.
-
(2001)
UAI'01
, pp. 554-561
-
-
Welling, M.1
Teh, Y.2
|