Fine-tuning the odds in Bayesian networks
From MaRDI portal
Publication:2146027
DOI10.1007/978-3-030-86772-0_20OpenAlexW3201904656MaRDI QIDQ2146027
Bahare Salmani, Joost-Pieter Katoen
Publication date: 15 June 2022
Full work available at URL: https://arxiv.org/abs/2105.14371
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric probabilistic transition systems for system design and analysis
- Properties of sensitivity analysis of Bayesian belief networks
- A distance measure for bounding probabilistic belief change
- Parameter synthesis for Markov models: faster than ever
- Analysis of Bayesian networks via prob-solvable loops
- Finding provably optimal Markov chains
- Bayesian inference by symbolic model checking
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Complex probabilistic modeling with recursive relational Bayesian networks
- Co-variation for sensitivity analysis in Bayesian networks: properties, consequences and alternatives
- The complexity of reachability in parametric Markov decision processes
- Sensitivity analysis: an aid for belief-network quantification
- Model Repair for Probabilistic Systems
- Are Parametric Markov Chains Monotonic?
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs
- Balanced Tuning of Multi-dimensional Bayesian Network Classifiers
- Modeling and Reasoning with Bayesian Networks
- Theoretical Aspects of Computing - ICTAC 2004
- Synthesis in pMDPs: a tale of 1001 parameters
- Accelerated model checking of parametric Markov chains
This page was built for publication: Fine-tuning the odds in Bayesian networks
