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

Muthukrishnan Senthil Kumar

Displaying similar documents to “A discrete-time Geo[X]/G/1 retrial queue with general retrial time and M-additional options for service”

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...

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

Moshe Haviv, Rita Zlotnikov (2011)

RAIRO - Operations Research

Similarity:

We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold . Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [ (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process...

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.

Structure of approximate solutions of variational problems with extended-valued convex integrands

Alexander J. Zaslavski (2008)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this work we study the structure of approximate solutions of autonomous variational problems with a lower semicontinuous strictly convex integrand : × $\to$ $\cup$ ${\infty}$ , where is the -dimensional Euclidean space. We obtain a full description of the structure of the approximate solutions which is independent of the length of the interval, for all sufficiently large intervals.

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

A vertex of a graph = () is said to be by $M \subseteq V$ if the majority of the elements of the neighborhood of (including itself) belong to . The set is a in if every vertex $i \in V$ is controlled by . Given a set $M \subseteq V$ and two graphs = ( $V, E_{1}$ ) and = ( $V, E_{2}$ ) where $E_{1} \subseteq E_{2}$ , the consists of deciding whether there exists a sandwich graph = () (, a graph where $E_{1} \subseteq E \subseteq E_{2}$ ) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich...

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity: