Pages that link to "Item:Q3696262"

The following pages link to Regenerative Analysis and Steady State Distributions for Markov Chains (Q3696262):

Displaying 50 items.

• Accurate calculations of stationary distributions and mean first passage times in Markov renewal processes and Markov chains (Q261308) (← links)
• The computation of key properties of Markov chains via perturbations (Q331164) (← links)
• Continue, quit, restart probability model (Q333092) (← links)
• On the finite buffer queue with renewal input and batch Markovian service process: \(\mathrm{GI}/\mathrm{BMSP}/1/N\) (Q398792) (← links)
• Analysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival process (Q488600) (← links)
• Analysis of a finite buffer variable batch service queue with batch Markovian arrival process and server's vacation (Q522407) (← links)
• Loss probability in an overloaded discrete-time \(GI/G/1/K\) system with very large \(K\). (Q703256) (← links)
• Accurate numerical solution for shifted \(M\)-matrix algebraic Riccati equations (Q777038) (← links)
• Analyses of an M/M/N queue with servers' vacations (Q808563) (← links)
• On a direct method for the solution of nearly uncoupled Markov chains (Q911215) (← links)
• Entrywise relative perturbation bounds for exponentials of essentially non-negative matrices (Q958156) (← links)
• The infinite-buffer single server queue with a variant of multiple vacation policy and batch Markovian arrival process (Q965600) (← links)
• Analysis of stationary discrete-time \(GI/D-MSP/1\) queue with finite and infinite buffers (Q976978) (← links)
• Analysis of the stationary \(E_ k/C_ 2/s\) queueing system (Q1108691) (← links)
• Stationary distributions in a queueing system with vacation times and limited service (Q1115032) (← links)
• Exploiting the Toeplitz structure in certain queueing problems (Q1127955) (← links)
• Probabilistic approach to computational algorithms for finding stationary distributions of Markov chains (Q1177197) (← links)
• Using state reduction for computing steady state vectors in Markov chains of \(M/G/1\) type (Q1183690) (← links)
• Optimizing steady state Markov chains by state reduction (Q1266688) (← links)
• The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem (Q1304617) (← links)
• Analysis of nonpreemptive priority queues with multiple servers and two priority classes (Q1307819) (← links)
• Perturbation results for nearly uncoupled Markov chains with applications to iterative methods (Q1326392) (← links)
• Entrywise perturbation theory and error analysis for Markov chains (Q1326397) (← links)
• Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks. (Q1406657) (← links)
• A direct projection method for Markov chains (Q1434408) (← links)
• Finding equilibrium probabilities of QBD processes by spectral methods when eigenvalues vanish (Q1434423) (← links)
• Security screening queues with impatient applicants: a new model with a case study (Q1681148) (← links)
• The computation of the mean first passage times for Markov chains (Q1747110) (← links)
• Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes (Q1761991) (← links)
• Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering (Q1771369) (← links)
• On a two-level multigrid solution method for finite Markov chains (Q1894507) (← links)
• Modelling traffic queues at a signalized intersection with vehicle- actuated control and Markovian arrival processes (Q1903203) (← links)
• Accurate numerical solution for structured \(M\)-matrix algebraic Riccati equations (Q2029690) (← links)
• Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system (Q2065481) (← links)
• Parallel computing for Markov chains with islands and ports (Q2095208) (← links)
• A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service (Q2144216) (← links)
• Finite-state-space truncations for infinite quasi-birth-death processes (Q2205203) (← links)
• Performance and stability of direct methods for computing generalized inverses of the graph Laplacian (Q2208933) (← links)
• Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline (Q2307283) (← links)
• On the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing system (Q2307989) (← links)
• Highly accurate doubling algorithm for quadratic matrix equation from quasi-birth-and-death process (Q2332400) (← links)
• Stability of a two-queue cyclic polling system with BMAPs under gated service and state-dependent time-limited service disciplines (Q2360880) (← links)
• On the batch arrival batch service queue with finite buffer under server's vacation: \(MX/GY/1/N\) queue (Q2389471) (← links)
• Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor (Q2402981) (← links)
• Accurate solutions of \(M\)-matrix Sylvester equations (Q2428544) (← links)
• Analysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal control (Q2444206) (← links)
• The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields (Q2512808) (← links)
• Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method (Q2514448) (← links)
• Steady-state Markov chain models for certain \(q\)-confluent hypergeometric distributions (Q2568424) (← links)
• Analysis of the asymmetric shortest queue problem (Q2640244) (← links)