Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Analysis of Bayesian networks via prob-solvable loops

From MaRDI portal
Publication:2037946
Jump to:navigation, search

DOI10.1007/978-3-030-64276-1_12OpenAlexW3109436335WikidataQ124212493 ScholiaQ124212493MaRDI QIDQ2037946

Laura Kovács, Ezio Bartocci, Miroslav Stankovič

Publication date: 8 July 2021

Full work available at URL: https://arxiv.org/abs/2007.09450



Mathematics Subject Classification ID

Theory of computing (68Qxx)


Related Items (5)

Fine-tuning the odds in Bayesian networks ⋮ The probabilistic termination tool amber ⋮ Solving invariant generation for unsolvable loops ⋮ Automated termination analysis of polynomial probabilistic programs ⋮ Moment-based analysis of Bayesian network properties




This page was built for publication: Analysis of Bayesian networks via prob-solvable loops

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2037946&oldid=14508713"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 20:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki