Updating credal networks is approximable in polynomial time (Q2375322)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Updating credal networks is approximable in polynomial time |
scientific article |
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
