Mini-buckets: A general scheme for bounded inference
暂无分享,去创建一个
[1] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[2] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[3] Robert G. Gallager,et al. A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.
[4] Umberto Bertelè,et al. Parametrization in nonserial dynamic programming , 1971 .
[5] Ugo Montanari,et al. On the Optimal Approximation of Discrete Functions with Low-dimensional Tables , 1971, IFIP Congress.
[6] Umberto Bertelè,et al. Nonserial Dynamic Programming , 1972 .
[7] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[8] C. Cannings,et al. Probability functions on complex pedigrees , 1978, Advances in Applied Probability.
[9] Eugene C. Freuder. Synthesizing constraint expressions , 1978, CACM.
[10] Probability functions on complex pedigrees , 1978 .
[11] H. E. Pople,et al. Internist-1, an experimental computer-based diagnostic consultant for general internal medicine. , 1982, The New England journal of medicine.
[12] Eugene C. Freuder. A Sufficient Condition for Backtrack-Free Search , 1982, JACM.
[13] H. E. Pople,et al. Internist-I, an Experimental Computer-Based Diagnostic Consultant for General Internal Medicine , 1982 .
[14] Stefan Arnborg,et al. Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.
[15] Alan K. Mackworth. Constraint Satisfaction , 1985 .
[16] F E Masarie,et al. Quick medical reference (QMR) for diagnostic assistance. , 1986, M.D.Computing.
[17] Ross D. Shachter. Evaluating Influence Diagrams , 1986, Oper. Res..
[18] Rina Dechter,et al. Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..
[19] Eric Horvitz,et al. Reasoning about beliefs and actions under computational resource constraints , 1987, Int. J. Approx. Reason..
[20] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .
[21] Mark S. Boddy,et al. An Analysis of Time-Dependent Planning , 1988, AAAI.
[22] Judea Pearl,et al. Chapter 2 – BAYESIAN INFERENCE , 1988 .
[23] Randolph A. Miller,et al. Using Causal Knowledge to Create Simulated Patient Cases: The CPCS Project as an Extension of INTERNIST-1 , 1988 .
[24] Rina Dechter,et al. Network-based heuristics for constraint satisfaction problems , 1988 .
[25] Eric Horvitz,et al. Reasoning under Varying and Uncertain Resource Constraints , 1988, AAAI.
[26] Eric Horvitz,et al. Bounded Conditioning: Flexible Inference for Decisions under Scarce Resources , 2013, UAI 1989.
[27] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[28] James A. Reggia,et al. A connectionist model for diagnostic problem solving , 1989, IEEE Trans. Syst. Man Cybern..
[29] Mark S. Boddy,et al. Solving Time-Dependent Planning Problems , 1989, IJCAI.
[30] Ross D. Shachter,et al. Dynamic programming and influence diagrams , 1990, IEEE Trans. Syst. Man Cybern..
[31] Frank Jensen,et al. Approximations in Bayesian Belief Universe for Knowledge Based Systems , 2013, UAI 1990.
[32] Gregory F. Cooper,et al. The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..
[33] Solomon Eyal Shimony,et al. A new algorithm for finding MAP assignments to belief networks , 1990, UAI.
[34] Eugene Santos,et al. On the Generation of Alternative Explanations with Implications for Belief Revision , 1991, UAI.
[35] D. Heckerman,et al. ,81. Introduction , 2022 .
[36] R. Dechter. to Constraint Satisfaction , 1991 .
[37] Eric Joel Hovitz. Computation and action under bounded resources , 1991 .
[38] Uffe Kjærulff. Optimal decomposition of probabilistic networks by simulated annealing , 1992 .
[39] Christophe Lecoutre. Constraint Networks , 1992 .
[40] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[41] Michael Luby,et al. Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard , 1993, Artif. Intell..
[42] Dan Roth,et al. On the Hardness of Approximate Reasoning , 1993, IJCAI.
[43] Denise Draper,et al. Localized Partial Evaluation of Belief Networks , 1994, UAI.
[44] Michael P. Wellman,et al. State-Space Abstraction for Anytime Evaluation of Probabilistic Networks , 1994, UAI.
[45] Gregory M. Provan,et al. Knowledge Engineering for Large Belief Networks , 1994, UAI.
[46] Rina Dechter,et al. Directional Resolution: The Davis-Putnam Procedure, Revisited , 1994, KR.
[47] Bruce D'Ambrosio,et al. Symbolic Probabilistic Inference in Large BN20 Networks , 1994, UAI.
[48] Uffe Kjærulff,et al. Reduction of Computational Complexity in Bayesian Networks Through Removal of Weak Dependences , 1994, UAI.
[49] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[50] Rina Dechter,et al. Diagnosing Tree-Decomposable Circuits , 1995, IJCAI.
[51] Rina Dechter. Bucket elimination: a unifying framework for processing hard and soft constraints , 1996, CSUR.
[52] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[53] David Poole,et al. Probabilistic Conflicts in a Search Algorithm for Estimating Posterior Probabilities in Bayesian Networks , 1996, Artif. Intell..
[54] Nevin Lianwen Zhang,et al. Exploiting Causal Independence in Bayesian Network Inference , 1996, J. Artif. Intell. Res..
[55] Michael I. Jordan,et al. Recursive Algorithms for Approximating Probabilities in Graphical Models , 1996, NIPS.
[56] David Heckerman,et al. Causal independence for probability assessment and inference using Bayesian networks , 1996, IEEE Trans. Syst. Man Cybern. Part A.
[57] Rina Dechter,et al. Bucket elimination: A unifying framework for probabilistic inference , 1996, UAI.
[58] Rina Dechter,et al. Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning , 1997, IJCAI.
[59] R. van Engelen,et al. Approximating Bayesian belief networks by arc removal , 1997, IEEE Trans. Pattern Anal. Mach. Intell..
[60] Hans L. Bodlaender,et al. Treewidth: Algorithmic Techniques and Results , 1997, MFCS.
[61] Edward H. Adelson,et al. Belief Propagation and Revision in Networks with Loops , 1997 .
[62] Rina Dechter,et al. A Scheme for Approximating Probabilistic Inference , 1997, UAI.
[63] Brendan J. Frey,et al. A Revolution: Belief Propagation in Graphs with Cycles , 1997, NIPS.
[64] Peter van Beek,et al. Local and Global Relational Consistency , 1995, Theor. Comput. Sci..
[65] Daniel FrostDepartment. Backtracking Algorithms for Constraint Satisfaction Problems { a Tutorial Survey , 1998 .
[66] Eugene Santos,et al. Deterministic approximation of marginal probabilities in Bayes nets , 1998, IEEE Trans. Syst. Man Cybern. Part A.
[67] Jung-Fu Cheng,et al. Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..
[68] Brendan J. Frey,et al. Graphical Models for Machine Learning and Digital Communication , 1998 .
[69] Xavier Boyen,et al. Tractable Inference for Complex Stochastic Processes , 1998, UAI.
[70] Jung-Fu Cheng. Iterative decoding , 1998 .
[71] R. Dechter,et al. On the impact of causal independence , 1998 .
[72] R. Dechter,et al. Stochastic Local Search for Bayesian Networks , 1999 .
[73] Rina Dechter,et al. Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..
[74] Rina Dechter,et al. Mini-Bucket Heuristics for Improved Search , 1999, UAI.
[75] Rina Dechter,et al. Stochastic local search for Bayesian network , 1999, AISTATS.
[76] Javier Larrosa. On the Time Complexity of Bucket Elimination Algorithms , 2000 .
[77] W. Freeman,et al. Generalized Belief Propagation , 2000, NIPS.
[78] Kalev Kask. New Search Heuristics for Max-CSP , 2000, CP.
[79] R. Dechter,et al. Bucket-Tree Elimination for Automated , 2001 .
[80] Rina Dechter,et al. A general scheme for automatic generation of search heuristics from specification dependencies , 2001, Artif. Intell..
[81] Linda C. van der Gaag,et al. Pre-processing for Triangulation of Probabilistic Networks , 2001, UAI.
[82] Fabio Gagliardi Cozman,et al. Bucket-Tree Elimination for Automated Reasoning , 2001 .
[83] William H. Hsu,et al. A Survey of Algorithms for Real-Time Bayesian Network Inference , 2002 .
[84] James D. Park,et al. MAP Complexity Results and Approximation Methods , 2002, UAI.
[85] Rina Dechter,et al. Tree approximation for belief updating , 2002, AAAI/IAAI.
[86] Rina Dechter,et al. Iterative Join-Graph Propagation , 2002, UAI.
[87] Sheng Ma,et al. Accuracy vs. efficiency trade-offs in probabilistic diagnosis , 2002, AAAI/IAAI.
[88] Michael J. Maher,et al. On Fourier's algorithm for linear arithmetic constraints , 1992, Journal of Automated Reasoning.
[89] Michael I. Jordan,et al. An Introduction to Variational Methods for Graphical Models , 1999, Machine Learning.
[90] Rina Dechter. Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints , 2004, Constraints.
[91] Rina Dechter,et al. Resolution versus Search: Two Strategies for SAT , 2000, Journal of Automated Reasoning.