MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering [1 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Nihal Pekergin, Tugrul Dayar, Denizhan N. Alparslan
European Journal of Operational Research
ftp://ftp.cs.bilkent.edu.tr/pub/tech-reports/2002/BU-CE-0202.ps.gz
Add To MetaCart

Abstract:

Markov chains using stochastic comparison and reordering

Citations

378 Introduction to the Numerical Solution of Markov Chains – Stewart - 1995
160 Comparison Methods for Queues and Other Stochastic Models – Stoyan - 1983
95 Stochastic Orders and Their Applications – Shaked, Shanthikumar - 1994
90 Decomposability: Queueing and Computer System Applications – Courtois - 1977
60 A Histogram-Based Model for Video Traffic Behavior in an ATM Network Node with an Application to Congestion Control – Skelly, Dixit, et al.
50 Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems – Meyer - 1989
39 Regenerative analysis and steady state distributions for Markov chains – Grassmann, Taksar, et al. - 1985
17 Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition – Courtois, Semal - 1984
12 Stochastic orderings for Markov processes on partially ordered spaces – Massey - 1987
11 Comparison of Partitioning Techniques for TwoLevel Iterative – Dayar, Stewart
5 Permuting Markov chains to nearly completely decomposable form – Dayar - 1998
5 Monotone matrices and monotone Markov processes – Keilson, Kester - 1977
4 An algorithm to bound functionals of Markov chains with large state space – Abu-Amsha, Vincent - 1998
4 Stochastically minimizing the makespan in two-machine flow shops without blocking – Kamburowski - 1999
4 MRAP: Multiservices Resource Allocation Policy for Wireless ATM Network – V`eque, Ben-Othman - 1998
3 On the effects of using the Grassmann-Taksar-Heyman method in iterative aggregation-disaggregation – Dayar, Stewart - 1996
3 Analysis of large Markov models, bounding techniques and applications, Doctoral Thesis, Universit'e Catholique de Louvain – Semal - 1992
2 Stochastic delay bounds on fair queueing algorithms – Pekergin - 1999
1 Stochastic comparison, reorderings, and nearly completely decomposable Markov chains – Dayar, Pekergin - 1999
1 Stochastic performance bounds by state reduction, Performance Evaluation 36--37 – Pekergin - 1999
1 Determination of the optimal upper bound of a Markovian generator – Tremolieres, Vincent, et al. - 1992
1 Near complete decomposability: bounding the error by stochastic comparison method – Truffet - 1997
View or Download | Add to My Collection | Correct Errors