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

scientific article

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

zbMath1015.68199MaRDI QIDQ2752130

Andrés Cano, Serafín Moral

Publication date: 21 October 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computation with imprecise probabilitiesconstraint propagation problems


Mathematics Subject Classification ID

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


Related Items (8)

Using probability trees to compute marginals with imprecise probabilities ⋮ Graphical models for imprecise probabilities ⋮ Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Distribution of expected utility in decision trees ⋮ Probabilistic abduction without priors ⋮ Degree of imprecision: geometric and algorithmic approaches ⋮ Extreme points of the credal sets generated by comparative probabilities




This page was built for publication:

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