192 search results - page 5 / 39 » On priority queues with priority jumps |
184
Voted
QUESTA
2007
15 years 5 months ago
2007
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
174
click to vote
DKE
2002
15 years 5 months ago
2002
The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a pri...
ORL
2006
15 years 5 months ago
2006
We consider a memoryless single server queue with two classes of customers, each having its fixed entry fee. We show that profit and social welfare may benefit from a service disc...
179
click to vote
DM
1999
15 years 5 months ago
1999
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
183
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
-In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) gu...