On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables.
Denis Deratani MauáCassio Polpo de CamposMarco ZaffalonPublished in: Artif. Intell. (2013)
Keyphrases
- limited memory
- binary variables
- influence diagrams
- decision problems
- sensitivity analysis
- probabilistic inference
- decision making
- computational complexity
- bayesian networks
- graphical models
- sliding window
- utility function
- optimal policy
- np hard
- belief networks
- pairwise
- partially observable
- memory space
- data streams
- search algorithm