Results 71 to 80 of about 1,233,375 (277)
A study of some M[x]/G/1 type queues with random breakdowns and bernouilli schedule server vacations based on a single vacation policy [PDF]
, 2008 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Queueing systems arise in modelling of many practical applications related to computer sciences, telecommunication networks, manufacturing and production ...
Maraghi, Farzana Abdulla
core +5 more sources
On the power of (even a little) resource pooling
Stochastic Systems, 2012 We propose and analyze a multi-server model that captures a performance trade-off between centralized and distributed processing. In our model,a fraction p of an available resource is deployed in a centralized manner (e.g., to serve a most-loaded station)
Kuang Xu, John N. Tsitsiklis
doaj
Priority Auctions and Queue Disciplines that Depend on Processing Time [PDF]
Lecture on the first SFB/TR 15 meeting, Gummersbach, July, 18 - 20, 2004We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing ...
Kittsteiner, Thomas, Moldovanu, Benny
core
Fast Methods for Eikonal Equations: An Experimental Survey
IEEE Access, 2019 Fast methods are very popular algorithms to compute time-of-arrival maps (distance maps measured in time units) solving the Eikonal equation. Since fast marching was proposed in 1995, it has been applied to many different applications, such as robotics ...
J. V. Gomez +3 more
doaj +1 more source
Queue lengths and waiting times in the two-class two-server queue with nonpreemptive heterogeneous priority structures. [PDF]
Our aim is to analyze a multiserver queue with nonpreemptive heterogeneous priority structures, which arises in the performance evaluation of batch initiator settings n MVS.
Leemans, Herlinde, Dedene, Guido
core
Lévy-driven polling systems and continuous-state branching processes
Stochastic Systems, 2011 In this paper we consider a ring of N ≥ 1 queues served by a single server in a cyclic order. After having served a queue (according to a service discipline that may vary from queue to queue), there is a switch-over period and then the server serves the ...
Michel Mandjes +3 more
doaj
LabVIEW based measurements and control system of a micro-ORC installation with Scroll Expander
E3S Web of Conferences, 2018 An innovative ORC-installation with a scroll engine as expansion device has been developed and designed at the City University of Applied Sciences in Bremen.
Eicke Albrecht, Smolen Sławomir
doaj +1 more source
Artificial intelligence and liquidation: Reality, destiny and fantasy
International Insolvency Review, EarlyView.Abstract Artificial intelligence (AI) is increasingly reshaping the administration of corporate liquidation. Beyond its established role in financial prediction and data analytics, AI is now assisting insolvency practitioners in identifying the onset of financial distress, managing creditor communications, tracing and valuing assets and enhancing ...
Kai Zhang, Jingchen Zhao
wiley +1 more source
Laws of Little in an open queueing network
Nonlinear Analysis, 2012 The object of this research in the queueing theory is theorems about the functional strong laws of large numbers (FSLLN) under the conditions of heavy traffic in an open queueing network (OQN).
Saulius Minkevičius, Stasys Steišūnas
doaj
IEEE Access, 2018 This paper presents an optimization model for determining the optimal time-varying numbers of cashiers and pharmacists in a large hospital. The objective of this model is to minimize the weighted sum of the waiting cost incurred by patients and the ...
Chung-Cheng Lu +3 more
doaj +1 more source