Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

JACM
2000

favoriteEmaildiscussreport

56views more JACM 2000»

Complexity of finite-horizon Markov decision process problems

13 years 10 months ago

Complexity of finite-horizon Markov decision process problems

Download www.cs.rutgers.edu

Martin Mundhenk, Judy Goldsmith, Christopher Lusen

Real-time Traffic

JACM 2000 |

claim paper

Related Content

» An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs

» SimulationBased Optimization Algorithms for FiniteHorizon Markov Decision Processes

» Eventtriggered output feedback control of finite horizon discretetime multidimensional lin...

» Unknown Rewards in FiniteHorizon Domains

» Relational Partially Observable MDPs

» Winning back the CUP for distributed POMDPs planning over continuous belief spaces

» QuasiDeterministic Partially Observable Markov Decision Processes

» The Complexity of Decentralized Control of Markov Decision Processes

» Optimality and Complexity of Opportunistic Spectrum Access A Truncated Markov Decision Pro...

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	JACM
Authors	Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender

Comments (0)