首页 /研究 /On the complexity of finite memory policies for Markov decision processes
OTHER

On the complexity of finite memory policies for Markov decision processes

Danièle Beauquier, Dima Burago, Anatol Slissenko

发表年份
1995
引用次数
9

关键词

Markov decision processProbabilistic logicComputer scienceClass (philosophy)Markov processPartially observable Markov decision processMathematical optimizationDecision problemTheoretical computer scienceMathematical economics

相关论文

查看 OTHER 分类全部论文