Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
ICALP, 2012.

ICALP v1 2012
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-v1-2012-EtessamiSY,
	author        = "Kousha Etessami and Alistair Stewart and Mihalis Yannakakis",
	booktitle     = "{Proceedings of the 39th International Colloquium on Automata, Languages, and Programming, Part I}",
	doi           = "10.1007/978-3-642-31594-7_27",
	isbn          = "978-3-642-31593-0",
	pages         = "314--326",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations}",
	volume        = 7391,
	year          = 2012,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.