Bucket Elimination: A Unifying Framework for Probabilistic Inference-Reference-Cited by-同舟云学术

Bucket Elimination: A Unifying Framework for Probabilistic Inference

Published:1998 Issue: Volume: Page:75-104
ISSN:
Container-title:Learning in Graphical Models
language:
Short-container-title:

Author:

Dechter R.

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-011-5014-9_4

Reference39 articles.

1. S. Arnborg and A. Proskourowski. Linear time algorithms for np-hard problems restricted to partial k-trees. Discrete and Applied Mathematics, 23: 11–24, 1989.

2. S.A. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT, 25: 2–23, 1985.

3. F. Bacchus and P. van Run. Dynamic variable ordering in csps. In Principles and Practice of Constraints Programming (CP-95), Cassis, France, 1995.

4. A. Becker and D. Geiger. A sufficiently fast algorithm for finding close to optimal jnmction trees. In Uncertainty in Al (UAI-96), pages 81–89, 1996.

5. U. Bertele and F. Brioschi. Nonserial Dynamic Programming. Academic Press, 1972.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimizing Rough Set Flow Graph Inference;Lecture Notes in Computer Science;2024

2. Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm;npj Quantum Information;2023-07-25

3. VolcanoML: speeding up end-to-end AutoML via scalable search space decomposition;The VLDB Journal;2022-07-01

4. Value‐based potentials: Exploiting quantitative information regularity patterns in probabilistic graphical models;International Journal of Intelligent Systems;2021-07-26

5. A Hierarchical Bayesian Network Model for Flood Resilience Quantification of Housing Infrastructure Systems;ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part A: Civil Engineering;2021-03