Results 91 to 100 of about 756 (151)

Convolution Algorithms for BMAP/G/1-Queues

open access: yes, 1996
The equilibrium state probabilities for queues with batch Markovian arrival processes are determined in form of matrix expressions, in which the central item to be computed is the so called fundamental-period-matrix G .
D. Baum
core  

State of the Art--Networks of Queues: A Survey of Weak Convergence Results

open access: yes
This report is a sequel to our review paper, Lemoine [Lemoine, A. J. 1977. Networks of queues-A survey of equilibrium analysis. Management sci. 24 464-481.], on the equilibrium analysis of networks of queues. In this paper we review some weak convergence
Austin J. Lemoine
core   +1 more source

ON SOME ASPECTS OF THE MANAGEMENT OF A STOCHASTICALLY DEVELOPING FOREST

open access: yes
In this paper I focus on some important biological aspects of the forest management problem. I model a stochastically developing forest as a multidimensional, continuous-time Markov chain.
Batabyal, Amitrajeet A.
core  

Importance Sampling for a Markov Modulated Queuing Network with Customer Impatience until the End of Service [PDF]

open access: yes
For more than two decades, there has been a growing of interest in fast simulation techniques for estimating probabilities of rare events in queuing networks. Importance sampling is a variance reduction method for simulating rare events.
Amir Masoud RAHMANI   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy