Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations (Q2843258)
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 6197683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations |
scientific article; zbMATH DE number 6197683 |
Statements
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (English)
0 references
12 August 2013
0 references
0.9506278038024902
0 references
0.8165733218193054
0 references
