Variable elimination for influence diagrams with super value nodes
From MaRDI portal
Publication:990975
DOI10.1016/j.ijar.2009.11.004zbMath1213.68625OpenAlexW1989276639MaRDI QIDQ990975
Manuel Luque, Francisco Javier Díez
Publication date: 2 September 2010
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2009.11.004
Related Items (6)
Decision analysis networks ⋮ Probabilistic decision graphs for optimization under uncertainty ⋮ An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes ⋮ Probabilistic decision graphs for optimization under uncertainty ⋮ Variable elimination for influence diagrams with super value nodes ⋮ Strategy Graphs for Influence Diagrams
Uses Software
Cites Work
- A comparison of two approaches for solving unconstrained influence diagrams
- Variable elimination for influence diagrams with super value nodes
- Potential influence diagrams
- Dynamic programming and influence diagrams
- Bayesian Networks and Decision Graphs
- Valuation-Based Systems for Bayesian Decision Analysis
- Probabilistic Networks and Expert Systems
- Efficient computation for the noisy MAX
- AN EXTENSION OF LAZY EVALUATION FOR INFLUENCE DIAGRAMS AVOIDING REDUNDANT VARIABLES IN THE POTENTIALS
- Unnamed Item
- Unnamed Item
This page was built for publication: Variable elimination for influence diagrams with super value nodes