Verification of Markov Decision Processes using Learning Algorithms? Tom´asˇ Br´azdil1 , Krishnendu Chatterjee2 , Martin Chmel´ık2 , Vojtˇech Forejt3 , Jan Kˇret´ınsk´y2 , Marta Kwiatkowska3 , David Parker4 , a

First Page		Document Content
Date: 2015-03-30 13:03:10 Computational complexity theory Dynamic programming Markov processes Stochastic control Analysis of algorithms Markov decision process Reinforcement learning Time complexity PP Reachability		Verification of Markov Decision Processes using Learning Algorithms? Tom´asˇ Br´azdil1 , Krishnendu Chatterjee2 , Martin Chmel´ık2 , Vojtˇech Forejt3 , Jan Kˇret´ınsk´y2 , Marta Kwiatkowska3 , David Parker4 , a Add to Reading List Source URL: qav.comlab.ox.ac.uk Download Document from Source Website File Size: 429,87 KB Share Document on Facebook

	Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem Nabil Abdennadher DocID: 1xTOs - View Document
	Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International DocID: 1vqMk - View Document
	Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore Rahul Jain* DocID: 1vouJ - View Document
	MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming DocID: 1vhRF - View Document
	EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples DocID: 1vg0M - View Document