Solving Generalized Semi-Markov Decision Processes Using Continuous Phase-Type Distributions
暂无分享,去创建一个
[1] A. Jensen,et al. Markoff chains as an aid in the study of Markoff processes , 1953 .
[2] Jussi Rintanen,et al. Expressive Equivalence of Formalisms for Planning with Sensing , 2003, ICAPS.
[3] Raymond A. Marie,et al. Calculating equilibrium probabilities for &lgr;(n)/Ck/1/N queues , 1980 .
[4] P. Glynn. A GSMP formalism for discrete event systems , 1989, Proc. IEEE.
[5] MarieRaymond. Calculating equilibrium probabilities for (n)/Ck/1/N queues , 1980 .
[6] Ronald A. Howard,et al. Dynamic Programming and Markov Processes , 1960 .
[7] Ronald A. Howard,et al. Dynamic Probabilistic Systems , 1971 .
[8] Masahiro Fujita,et al. Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..
[9] R. Bellman,et al. Dynamic Programming and Markov Processes , 1960 .
[10] Raymond A. Marie,et al. Calculating equilibrium probabilities for λ(n)/Ck/1/N queues , 1980, Performance.
[11] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[12] Marcel F. Neuts,et al. Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .
[13] Carlos Guestrin,et al. Multiagent Planning with Factored MDPs , 2001, NIPS.
[14] K. Mani Chandy,et al. Approximate Analysis of Central Server Models , 1975, IBM J. Res. Dev..
[15] Mor Harchol-Balter,et al. A Closed-Form Solution for Mapping General Distributions to Minimal PH Distributions , 2003, Computer Performance Evaluation / TOOLS.
[16] Jesse Hoey,et al. SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.