Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kao, Edward P. C.
1992.
Using state reduction for computing steady state vectors in Markov chains ofM/G/1 type.
Queueing Systems,
Vol. 10,
Issue. 1-2,
p.
89.
Bini, D.
and
Meini, B.
1993.
Solving certain queueing problems modelled by toeplitz matrices.
Calcolo,
Vol. 30,
Issue. 4,
p.
395.
Wei-Bo Gong
and
Hong Yang
1995.
Rational approximants for some performance analysis problems.
IEEE Transactions on Computers,
Vol. 44,
Issue. 12,
p.
1394.
Simonot, F.
1995.
Sur l'approximation de la distribution stationnaire d'une chaîne de Markov stochastiquement monotone.
Stochastic Processes and their Applications,
Vol. 56,
Issue. 1,
p.
133.
Simonot, F.
and
Song, Y. Q.
1996.
Characterization of convergence rates for the approximation of the stationary distribution of infinite monotone stochastic matrices.
Journal of Applied Probability,
Vol. 33,
Issue. 04,
p.
974.
Zhao, Y. Quennel
and
Liu, Danielle
1996.
The censored Markov chain and the best augmentation.
Journal of Applied Probability,
Vol. 33,
Issue. 03,
p.
623.
Simonot, F.
1997.
Convergence rate for the distributions of GI/M/1/n and M/GI/1/n as n tends to infinity.
Journal of Applied Probability,
Vol. 34,
Issue. 4,
p.
1049.
Sennott, Linn I.
1997.
The Computation of Average Optimal Policies in Denumerable State Markov Decision Chains.
Advances in Applied Probability,
Vol. 29,
Issue. 01,
p.
114.
1998.
Stochastic Dynamic Programming and the Control of Queueing Systems.
p.
316.
Shin, Yang Woo
and
Pearce, C. E. M.
1998.
An algorithmic approach to the Markov chain with transition probability matrix of upper block-Hessenberg form.
Korean Journal of Computational & Applied Mathematics,
Vol. 5,
Issue. 2,
p.
361.
Zhao, Yiqiang Q.
Braun, W. John
and
Li, Wei
1999.
Northwest corner and banded matrix approximations to a Markov chain.
Naval Research Logistics,
Vol. 46,
Issue. 2,
p.
187.
Pekergin, N.
1999.
Stochastic bounds on delays of fair queueing algorithms.
p.
1212.
Li, Haijun
and
Zhao, Yiqiang Q.
2000.
Stochastic block–monotonicity in the approximation of the stationary distribution of infinite markov chains.
Communications in Statistics. Stochastic Models,
Vol. 16,
Issue. 2,
p.
313.
Shin, Yang Woo
2001.
APPROXIMATIONS FOR MARKOV CHAINS WITH UPPER HESSENBERG TRANSITION MATRICES.
Journal of the Operations Research Society of Japan,
Vol. 44,
Issue. 1,
p.
90.
Takine, Tetsuya
2005.
Mean Buffer Contents in Discrete-Time Single-Server Queues with Heterogeneous Sources.
Queueing Systems,
Vol. 49,
Issue. 2,
p.
161.
Rukhin, Andrew L.
and
Bebu, Ionut
2006.
STOCHASTIC MODEL FOR THE NUMBER OF ATOMS IN A MAGNETO-OPTICAL
TRAP.
Probability in the Engineering and Informational Sciences,
Vol. 20,
Issue. 2,
p.
351.
Avram, F.
and
Gómez-Corral, A.
2006.
On bulk-service MAP/PHL,N/1/N G-Queues with repeated attempts.
Annals of Operations Research,
Vol. 141,
Issue. 1,
p.
109.
Ben Mamoun, Mouad
and
Pekergin, Nihal
2008.
Analytical and Stochastic Modeling Techniques and Applications.
Vol. 5055,
Issue. ,
p.
264.
Wang, Ning
and
Gulliver, T. Aaron
2011.
Packet level analysis for AMC in a wireless cooperative communication system over Nakagami-m fading channels.
p.
130.
Adel-Aissanou, Karima
Abbas, Karim
Aïssani, Djamil
and
Hong, Wei-Chiang
2012.
Strong Truncation Approximation in Tandem Queues with Blocking.
Mathematical Problems in Engineering,
Vol. 2012,
Issue. 1,