Results 181 to 190 of about 10,748 (214)
Some of the next articles are maybe not open access.
1999
This paper describes a system that supports the specification of a large set of simulations and their organization and distributes execution over a PC's network under Windows 95 and NT. Our objective is two faced: maximize resources utilization of IBERDROLA and the possibility of starting experiments that require a high compute power. As an example, we
Sergi Girona +6 more
openaire +1 more source
This paper describes a system that supports the specification of a large set of simulations and their organization and distributes execution over a PC's network under Windows 95 and NT. Our objective is two faced: maximize resources utilization of IBERDROLA and the possibility of starting experiments that require a high compute power. As an example, we
Sergi Girona +6 more
openaire +1 more source
Management Science, 1963
(This article originally appeared in Management Science, November 1963, Volume 10, Number 1, pp. 131–142, published by The Institute of Management Sciences.) The equilibrium joint probability distribution of queue lengths is obtained for a broad class of jobshop-like “networks of waiting lines,” where the mean arrival rate of customers depends almost
openaire +1 more source
(This article originally appeared in Management Science, November 1963, Volume 10, Number 1, pp. 131–142, published by The Institute of Management Sciences.) The equilibrium joint probability distribution of queue lengths is obtained for a broad class of jobshop-like “networks of waiting lines,” where the mean arrival rate of customers depends almost
openaire +1 more source
Information analysis of queueing systems
International Journal of General Systems, 2017AbstractA queueing system (QS) with finite size holds a current number N, and maximum number M, of present customers (waiting or being served), N ∊ {0, 1, … , M}. We model the system as family of Birth–Death Processes in equilibrium, with size M + 1, indexed by the system utilization parameter. Depending on the concepts of information i and entropy S =
openaire +1 more source
Reachability and Safety in Queue Systems
2001We look at a model of a queue system M that consists of the following components: 1. Two nondeterministic finite-state machines W and R, each augmented with finitely many reversal-bounded counters (thus, each counter can be incremented or decremented by 1 and tested for zero, but the number of alternations between nondecreasing mode and nonincreasing ...
openaire +1 more source
To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems
2003Refael Hassin, Moshe Haviv
openaire +1 more source
Analysis of a retrial queueing system with priority service and modified multiple vacations
Communications in Statistics - Theory and Methods, 2023Jia Xu, Kan Wu
exaly
Classical and Bayes estimation in the M|D|1 queueing system
Communications in Statistics - Theory and Methods, 2021V S Vaidyanathan, V S S Yadavalli
exaly