Convergence in distribution for subset counts between random sets.
Stark, Dudley (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On the distribution of waiting time until k-th repetition of any event.”
Convergence in distribution for subset counts between random sets.
Approximation of reliability for a large system with non-markovian repair-times
Jean-Louis Bon, Jean Bretagnolle (1999)
ESAIM: Probability and Statistics
Similarity:
Analysis of an asymmetric leader election algorithm.
Janson, Svante, Szpankowski, Wojiech (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Non-colliding random walks, tandem queues, and discrete orthogonal polynomial ensembles.
König, Wolfgang, O'Connell, Neil, Roch, Sébastien (2002)
Electronic Journal of Probability [electronic only]
Similarity:
Lajos Takács and his work.
Dshalalow, Jewgeni H., Syski, Ryszard (1994)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
A generalization of the Erlang's B formula
A. Lambros, A. Pombortsis, A. Sideridis, D. Tambouratzis (1989)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Limit distributions and random trees derived from the birthday problem with unequal probabilities.
Camarri, Michael, Pitman, Jim (2000)
Electronic Journal of Probability [electronic only]
Similarity:
Behaviour of passage time for a queueing network model with feedback: a simulation study.
Medya, Bidyut K. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The Truncated Hyper-Poisson Queues: With Balking, Reneging and General Bulk Service Rule
A. I. Shawky, M. S. El-Paoumy (2008)
The Yugoslav Journal of Operations Research
Similarity:
Performance evaluation of an M/G/n -type queue with bounded capacity and packet dropping
Oleg Tikhonenko, Wojciech M. Kempa (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss...
Longest increasing subsequences of random colored permutations.
Borodin, Alexei (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity: