Mixing exact and importance sampling propagation algorithms in dependence graphs
From MaRDI portal
Publication:4363345
DOI<553::AID-INT1>3.0.CO;2-J 10.1002/(SICI)1098-111X(199708)12:8<553::AID-INT1>3.0.CO;2-JzbMath0883.68103OpenAlexW2138215503MaRDI QIDQ4363345
Serafín Moral, Luis D. Hernández
Publication date: 26 February 1998
Full work available at URL: https://doi.org/10.1002/(sici)1098-111x(199708)12:8<553::aid-int1>3.0.co;2-j
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Related Items (3)
Imprecise Monte Carlo simulation and iterative importance sampling for the estimation of lower previsions ⋮ Importance sampling-based estimation over AND/OR search spaces for graphical models ⋮ A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
This page was built for publication: Mixing exact and importance sampling propagation algorithms in dependence graphs
