Topological parameters for time-space tradeoff
From MaRDI portal
Publication:5940780
DOI10.1016/S0004-3702(00)00050-3zbMath0969.68149MaRDI QIDQ5940780
Rina Dechter, Yousri M. Abd-El-Fattah
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
Bayesian networks; hybrid algorithms; automated inference; constraint networks; empirical evaluation; optimization tasks; time-space; topological parameters
68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
Related Items
Topological parameters for time-space tradeoff, Hybrid backtracking bounded by tree-decomposition of constraint networks, Local and global relational consistency, Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering, Unifying tree decompositions for reasoning in graphical models, Partition-based logical reasoning for first-order and propositional theories
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fusion, propagation, and structuring in belief networks
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Network-based heuristics for constraint-satisfaction problems
- Tree clustering for constraint networks
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Fusion and propagation with multiple observations in belief networks
- Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals
- Probability propagation
- Resolution versus search: Two strategies for SAT
- Bucket elimination: A unifying framework for reasoning
- Contribution to nonserial dynamic programming
- Local conditioning in Bayesian networks
- Complexity of Finding Embeddings in a k-Tree
- A Sufficient Condition for Backtrack-Free Search
- Topological parameters for time-space tradeoff