Updating credal networks is approximable in polynomial time (Q2375322)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6175640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Updating credal networks is approximable in polynomial time |
scientific article; zbMATH DE number 6175640 |
Statements
Updating credal networks is approximable in polynomial time (English)
0 references
13 June 2013
0 references
probabilistic graphical models
0 references
credal networks
0 references
approximation scheme
0 references
valuation algebra
0 references
0 references
0 references
0.8691900372505188
0 references
0.8689501881599426
0 references
0.8487427830696106
0 references
0.8466994762420654
0 references
0.8397591710090637
0 references
