A differential semantics for jointree algorithms
暂无分享,去创建一个
[1] Prakash P. Shenoy,et al. Propagating Belief Functions with Local Computations , 1986, IEEE Expert.
[2] Steffen L. Lauritzen,et al. Bayesian updating in causal probabilistic networks by local computations , 1990 .
[3] Adnan Darwiche,et al. Inference in belief networks: A procedural guide , 1996, Int. J. Approx. Reason..
[4] Jesse Hoey,et al. SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.
[5] Adnan Darwiche,et al. Approximating MAP using Local Search , 2001, UAI.
[6] J. Gathen. Algebraic complexity theory , 1988 .
[7] James D. Park,et al. MAP Complexity Results and Approximation Methods , 2002, UAI.
[8] Stuart J. Russell,et al. Local Learning in Probabilistic Networks with Hidden Variables , 1995, IJCAI.
[9] Volker Strassen,et al. Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[10] M. Iri. Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality— , 1984 .
[11] Adnan Darwiche,et al. A differential approach to inference in Bayesian networks , 2000, JACM.
[12] Adnan Darwiche,et al. A Logical Approach to Factoring Belief Networks , 2002, KR.
[13] Adnan Darwiche,et al. When do Numbers Really Matter? , 2001, UAI.
[14] G. Rote. Path Problems in Graphs , 1990 .