Computational schemes for two exponential servers where the first has a finite buffer

Moshe Haviv; Rita Zlotnikov

Displaying similar documents to “Computational schemes for two exponential servers where the first has a finite buffer”

A discrete-time Geo/G/1 retrial queue with general retrial time and M-additional options for service

Muthukrishnan Senthil Kumar (2011)

RAIRO - Operations Research

Similarity:

This paper concerns a discrete time Geo/G/1 retrial queue with general retrial time in which all the arriving customers require first essential service with probability $α_{0}$ while only some of them demand one of other optional services: − ( = 1, 2, 3,...) service with probability $α_{r}$ . The system state distribution, the orbit size and the system size distributions are obtained in terms of generating functions. The stochastic decomposition law holds for the proposed model. Performance...

A discrete-time Geo/G/1 retrial queue with general retrial time and M-additional options for service

Muthukrishnan Senthil Kumar (2011)

RAIRO - Operations Research

Similarity:

On the asymptotic properties of a simple estimate of the Mode

Christophe Abraham, Gérard Biau, Benoît Cadre (2010)

ESAIM: Probability and Statistics

Similarity:

We consider an estimate of the mode of a multivariate probability density with support in $ℝ^{d}$ using a kernel estimate drawn from a sample . The estimate is defined as any in {} such that $f_{n} (x) = {max}_{i = 1, \dots, n} f_{n} (X_{i})$ . It is shown that behaves asymptotically as any maximizer ${\hat{θ}}_{n}$ of . More precisely, we prove that for any sequence ${(r_{n})}_{n \geq 1}$ of positive real numbers such that $r_{n} \to \infty$ and $r_{n}^{d} log n / n \to 0$ , one has $r_{n} ∥ θ_{n} - {\hat{θ}}_{n} ∥ \to 0$ in probability. The asymptotic normality of follows without further work.