On the complexity of partially observed Markov decision processes

Author： Burago D.   de Rougemont M.   Slissenko A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.157, Iss.2, 1996-05, pp. : 161-183

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Parallel Rollout for Online Solution of Partially Observable Markov Decision Processes

By Chang Hyeong Soo   Givan Robert   Chong Edwin K. P.  

Discrete Event Dynamic Systems, Vol. 14, Iss. 3, 2004-07 ,pp. : 309-341

Springer Publishing Company

Access to resources Recommend Favorite

Constrained Markov decision processes with first passage criteria

By Huang Yonghui  

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 197-219

Springer Publishing Company

Access to resources Recommend Favorite

APPLICATION OF MARKOV DECISION PROCESSES TO THE FREQUENCY ASSIGNMENT PROBLEM

By GREFF JEAN-YVES  

Applied Artificial Intelligence, Vol. 18, Iss. 8, 2004-09 ,pp. : 761-773

Taylor & Francis Ltd

Access to resources Recommend Favorite

Dynamic Workflow Composition: Using Markov Decision Processes

By  

International Journal of Web Services Research (IJWSR), Vol. 2, Iss. 1, 2005-01 ,pp. : 1-17

IGI Global_journal

Access to resources Recommend Favorite

Evaluating the Markov assumption in Markov Decision Processes for spoken dialogue management

By Paek Tim   Chickering David  

Language Resources and Evaluation, Vol. 40, Iss. 1, 2006-02 ,pp. : 47-66

Springer Publishing Company

Access to resources Recommend Favorite