On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables (Q490443)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables |
scientific article; zbMATH DE number 6476327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables |
scientific article; zbMATH DE number 6476327 |
Statements
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables (English)
0 references
27 August 2015
0 references
decision theory
0 references
influence diagrams
0 references
decision networks
0 references
probabilistic planning
0 references
computational complexity
0 references
0.8683856129646301
0 references
0.812257707118988
0 references
0.7995220422744751
0 references
0.7791425585746765
0 references
0.7600483298301697
0 references
