Topological parameters for time-space tradeoff

DOI10.1016/S0004-3702(00)00050-3zbMath0969.68149OpenAlexW1984090594MaRDI QIDQ5940780

Rina Dechter, Yousri M. Abd-El-Fattah

Publication date: 20 August 2001

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00050-3

zbMATH Keywords

Bayesian networkshybrid algorithmsautomated inferenceconstraint networksempirical evaluationoptimization taskstime-spacetopological parameters

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (10)

Local and global relational consistency ⋮ Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models ⋮ Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ Combining restarts, nogoods and bag-connected decompositions for solving csps ⋮ 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 ⋮ Topological parameters for time-space tradeoff ⋮ Understanding the scalability of Bayesian network inference using clique tree growth curves ⋮ Hybrid backtracking bounded by tree-decomposition of constraint networks

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Topological parameters for time-space tradeoff