Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Gibson, Diana
and
Seneta, E.
1987.
Augmented truncations of infinite stochastic matrices.
Journal of Applied Probability,
Vol. 24,
Issue. 03,
p.
600.
Gibson, Diana
and
Seneta, E.
1987.
Monotone infinite stochastic matrices and their augmented truncations.
Stochastic Processes and their Applications,
Vol. 24,
Issue. 2,
p.
287.
Heyman, Daniel P.
and
Whitt, Ward
1989.
Limits for queues as the waiting room grows.
Queueing Systems,
Vol. 5,
Issue. 4,
p.
381.
Heyman, Daniel P.
1991.
Approximating the stationary distribution of an infinite stochastic matrix.
Journal of Applied Probability,
Vol. 28,
Issue. 1,
p.
96.
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.
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.
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. 4,
p.
974.
Zhao, Y. Quennel
and
Liu, Danielle
1996.
The censored Markov chain and the best augmentation.
Journal of Applied Probability,
Vol. 33,
Issue. 3,
p.
623.
Sennott, Linn I.
1997.
The Computation of Average Optimal Policies in Denumerable State Markov Decision Chains.
Advances in Applied Probability,
Vol. 29,
Issue. 1,
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.
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.
Bean, Nigel
and
Latouche, Guy
2010.
Approximations to quasi-birth-and-death processes with infinite blocks.
Advances in Applied Probability,
Vol. 42,
Issue. 4,
p.
1102.
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,
Fernández, J L
Melián, M V
and
Pestana, D
2012.
Expanding maps, shrinking targets and hitting times.
Nonlinearity,
Vol. 25,
Issue. 9,
p.
2443.
Issaadi, Badredine
Abbas, Karim
and
Aïssani, Djamil
2018.
A weak perturbation theory for approximations of invariant measures in M/G/1 model.
RAIRO - Operations Research,
Vol. 52,
Issue. 4-5,
p.
1411.
Lu, Yang
2020.
A simple parameter‐driven binary time series model.
Journal of Forecasting,
Vol. 39,
Issue. 2,
p.
187.