Bounds for the Coupling Time in Queueing Networks Perfect Simulation
暂无分享,去创建一个
[1] Peter W. Glynn,et al. The semi-regenerative method of simulation output analysis , 2006, TOMC.
[2] Peter W. Glynn,et al. Regenerative steady-state simulation of discrete-event systems , 2001, TOMC.
[3] Peter W. Glynn,et al. Initial transient problem for steady-state output analysis , 2005, Proceedings of the Winter Simulation Conference, 2005..
[4] Peter W. Glynn,et al. Importance sampling using the semi-regenerative method , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).
[5] Jean-Marc Vincent,et al. Perfect simulation of monotone systems for rare event probability estimation , 2005, Proceedings of the Winter Simulation Conference, 2005..
[6] Krzysztof Pawlikowski,et al. Steady-state simulation of queueing processes: survey of problems and solutions , 1990, CSUR.
[7] Olle Häggström. Finite Markov Chains and Algorithmic Applications , 2002 .
[8] William J. Stewart,et al. Introduction to the numerical solution of Markov Chains , 1994 .
[9] N. Zanghí,et al. Probability models , 1984 .
[10] David Bruce Wilson,et al. Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996, Random Struct. Algorithms.
[11] J. G. Matthews,et al. To Batch or Not to Batch? , 2007 .
[12] W. Whitt. The efficiency of one long run versus independent replication in steady-state simulation , 1991 .
[13] J.-M. Vincent. Perfect Simulation of Queueing Networks with Blocking and Rejection , 2005 .
[14] Michael A. Crane,et al. Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event Simulations , 1975, Oper. Res..
[15] Jean-Marc Vincent,et al. On the exact simulation of functionals of stationary Markov chains , 2004 .