We analyze the transient behavior of the PH/MI S/K queue. Emphasis is placed on the overflow process, busy period distribution, idle period distribution, accepted arrival process, departure process and the transition probabilities of the system states. All results are represented by the addition and multiplication of the matrices whose dimensions are at most equal to the number of phases for th...

This paper investigates a discrete-time impatient customer queue with Bernoullischedule vacation interruption. The vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer’s observation epochs using recursive technique. Cost analysis ...

The goal of this research is to analyze how individual learning interacts with an evolutionary algorithm in its search for best candidates for the Busy Beaver problem. To study this interaction two learning models, implemented as local search procedures, are proposed. Experimental results show that, in highly irregular and prone to premature convergence search spaces, local search methods are n...

Today I am going to exercise. Finally! I plan to leave my offi ce early and go to the gym on my way home. I just need to complete a few telephone calls and I will be on my way. Suddenly, the emergency department calls. Mrs S. is back with congestive heart failure and will likely need admission. There goes my new resolution. By the time I leave the emergency department, it is time to go home, ha...

The M=PH=1 system is introduced in this paper to analyze the superposition of a large number of data connections on an ATM link. In this model, information is transmitted in bursts of data arriving at the link as a Poisson process of rate and burst durations are PH distributed with unit mean. Explicit methods of computing the distributions of some transient characteristics related to excursions...