Pages that link to "Item:Q3579314"
From MaRDI portal
The following pages link to Constructive Computation in Stochastic Models with Applications (Q3579314):
Displayed 32 items.
- Nonlinear Markov processes in big networks (Q287605) (← links)
- Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time (Q319322) (← links)
- Stochastic epidemic models with random environment: quasi-stationarity, extinction and final size (Q376327) (← links)
- The queue length in an \(M/G/1\) batch arrival retrial queue (Q383224) (← links)
- \(LU\)-factorization versus Wiener-Hopf factorization for Markov chains (Q383600) (← links)
- Performance optimization of queueing systems with perturbation realization (Q439492) (← links)
- A complex discrete warm standby system with loss of units (Q439528) (← links)
- Asymptotics for the sojourn time distribution in the queue defined by a general QBD process with a countable phase space (Q475078) (← links)
- A simple method to obtain the stochastic decomposition structure of the busy period in \(\mathrm{Geo}/\mathrm{Geo}/1/N\) vacation queue (Q904287) (← links)
- Analysis of a batch service multi-server polling system with dynamic service control (Q1716985) (← links)
- An analysis of the \(M^X/M/1\) queue with multiple working vacations by \(GI/M/1\) type Markov process (Q1789067) (← links)
- Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization (Q2031356) (← links)
- A mean-field matrix-analytic method for bike sharing systems under Markovian environment (Q2070763) (← links)
- Optimal dynamic mining policy of blockchain selfish mining through sensitivity-based optimization (Q2091117) (← links)
- Double-ended queues with non-Poisson inputs and their effective algorithms (Q2147076) (← links)
- Sensitivity-based optimization for blockchain selfish mining (Q2151380) (← links)
- Optimal energy-efficient policies for data centers through sensitivity-based optimization (Q2177776) (← links)
- Algorithm for a general discrete \(k\)-out-of-\(n\): \(G\) system subject to several types of failure with an indefinite number of repairpersons (Q2275605) (← links)
- A complete algebraic solution to the optimal dynamic rationing policy in the stock-rationing queue with two demand classes (Q2696934) (← links)
- A preventive maintenance policy for a standby system subject to internal failures and external shocks with loss of units (Q2792890) (← links)
- An Overview for Markov Decision Processes in Queues and Networks (Q3305576) (← links)
- A Survey for Stochastic Decomposition in Vacation Queues (Q3305579) (← links)
- Analysis of a Tollbooth Tandem Queue with Two-Class Customers and Two Heterogeneous Dedicated Servers (Q4561179) (← links)
- Analysis of a two-class continuous-time queueing model with two tandem dedicated servers (Q4578152) (← links)
- ON MULTISERVER RETRIAL QUEUES: HISTORY, OKUBO-TYPE HYPERGEOMETRIC SYSTEMS AND MATRIX CONTINUED-FRACTIONS (Q5166392) (← links)
- TAIL PROBABILITIES IN QUEUEING PROCESSES (Q5166398) (← links)
- Computational analysis of \(GI^{[X]}/D-MSP^{(a,b)}/1\) queueing system via \textit{RG}-factorization (Q6046970) (← links)
- Computation of the steady-state probability of Markov chain evolving on a mixed state space (Q6073728) (← links)
- Matched queues with flexible and impatient customers (Q6164830) (← links)
- Detailed analytical and computational studies of \(D-BMAP/D-BMSP1\) queueing system (Q6164839) (← links)
- The optimal dynamic rationing policy in the stock-rationing queue (Q6167008) (← links)
- (Q6181944) (← links)