Skip to search formSkip to main contentSkip to account menu

Queue (abstract data type)

Known as: Amortized queue, Bounded queue, Real-time queue 
In computer science, a queue (/ˈkjuː/ KYEW) is a particular kind of abstract data type or collection in which the entities in the collection are kept… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We consider the PH/PH/c retrial queues with PH-retrial time. Approximation formulae for the distribution of the number of… 
2014
2014
Waiting on a queue is not usually interesting, but reduction in this waiting time usually requires planning and extra investments… 
2014
2014
This paper contains research and development results concerning application of hysteretic control principles to solve SIP servers… 
2013
2013
This paper discusses the effects of different fragmentation thresholds on data dropped and retransmission attempts in a wireless… 
2012
2012
Given the challenges of testing at the system level, only a fully automated approach can really scale up to industrial real-time… 
2008
2008
Purpose – The purpose of this paper is to develop an understanding of the role comprehensive business cases can have in ensuring… 
2006
2006
In the dynamic environment of semiconductor manufacturing operations, a bottleneck could be created at the bake furnaces of the… 
2002
2002
The current and future wireless systems need to support a multitude of services with a wide range of data rates and reliability… 
1989
1989
The V language describes VLSI systems concisely through the use of sequential algorithmic descriptions. Because V includes high… 
1986
1986
A service function, defined as a curve relating travel time to flow, is a standard element of many models of transport system…