Results 1 to 10 of about 571 (106)
Diffusion models for double-ended queues with renewal arrival processes [PDF]
Stochastic Systems, 2015 We study a double-ended queue where buyers and sellers arrive to conduct trades. When there is a pair of buyer and seller in the system, they immediately transact a trade and leave.
Xin Liu, Qi Gong, Vidyadhar G. Kulkarni
doaj +8 more sources
A Time-Non-Homogeneous Double-Ended Queue with Failures and Repairs and Its Continuous Approximation
Mathematics, 2018 We consider a time-non-homogeneous double-ended queue subject to catastrophes and repairs. The catastrophes occur according to a non-homogeneous Poisson process and lead the system into a state of failure. Instantaneously, the system is put under repair,
Antonio Di Crescenzo +3 more
doaj +3 more sources
Two new methods for constructing double-ended priority queues from priority queues [PDF]
Computing (Vienna/New York), 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amr Elmasry +2 more
exaly +5 more sources
An Analysis of the “Horizontal Y” Shaped Queuing Model to Assist in Health Care Institution [PDF]
International Journal Bioautomation, 2023 The “Horizontal Y” shaped queuing model in which there is bulk infinite arrival of patients, but available M services are limited. The discrete flow of patients in the system is reduced in continuous flow and a diffusion equation is used.
Manish Kumar Pandey +1 more
doaj +1 more source
Double-ended binomial queues [PDF]
International Journal of Foundations of Computer Science, 1993 This paper introduces a highly efficient double-ended heap structure called d-b-queues, which are an extension of binomial queues. D-b-queues achieve the following amortized time bounds: O(1) for findmin, findmax, insert, and merge operations, and O(logn) for deletemin, deletemax, decreasekey, increasekey, arbitrary delete, and split operations.
C. M. Khoong, H. W. Leong
openaire +3 more sources
A Mergeable Double-ended Priority Queue [PDF]
The Computer Journal, 1991 An implementation of a double-ended priority queue is discussed. This data structure referred to as min–max–pair heap can be built in linear time; the operations Delete-min, Delete-max and Insert take O(log n) time, while Find-min and Find-max run in O(1) time.
Stephan Olariu +2 more
openaire +2 more sources
Admission Control for Double-ended Queues
, 2021 We consider a controlled double-ended queue consisting of two classes of customers, labeled sellers and buyers. The sellers and buyers arrive in a trading market according to two independent renewal processes. Whenever there is a seller and buyer pair, they are matched and leave the system instantaneously.
Liu, Xin, Weerasinghe, Ananda
openaire +2 more sources
A Double-ended Queue with Catastrophes and Repairs, and a Jump-diffusion Approximation [PDF]
Methodology and Computing in Applied Probability, 2011 18 pages, 5 figures, paper accepted by "Methodology and Computing in Applied Probability", the final publication is available at http://www.springerlink ...
DI CRESCENZO, Antonio +3 more
openaire +2 more sources
Correspondence-based data structures for double-ended priority queues [PDF]
ACM Journal of Experimental Algorithmics, 2000 We describe three general methods--total, dual, and leaf correspondence--that may be used to derive efficient double-ended priority queues from single-ended priority queues. These methods are illustrated by developing double-ended priority queues based on the classical heap.
Kyunrak Chong, Sartaj Sahni
openaire +1 more source
IEEE AccessOrienteering, a sport that combines navigation with running, requires efficient route planning and real-time decision-making, which can benefit significantly from mobile crowdsensing (MCS) technologies.
Xia Hua, Lei Han
doaj +1 more source