128 search results - page 1 / 26 » A Simple Implementation Technique for Priority Search Queues |
ICFP
2001
ACM
14 years 5 months ago
2001
ACM
This paper presents a new implementation technique for priority search queues. This abstract data type is an amazing blend of finite maps and priority queues. Our implementation s...
PR
2010
13 years 10 days ago
2010
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...
HPDC
1995
IEEE
13 years 9 months ago
1995
IEEE
A novel packet multiplexing technique, called Rotating-Priority-Queues (RPQ), is presented which exploits the tradeoff between high eficiency, i.e., the ability to support many co...
JFP
2006
13 years 5 months ago
2006
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...
ISLPED
2006
ACM
13 years 11 months ago
2006
ACM
Buffering more in-flight instructions in an out-of-order microprocessor is a straightforward and effective method to help tolerate the long latencies generally associated with ...