Sciweavers

34 search results - page 3 / 7
» Parking functions, valet functions and priority queues
Sort
View
AIPS
2007
13 years 9 months ago
Prioritizing Bellman Backups without a Priority Queue
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
Peng Dai, Eric A. Hansen
QUESTA
2006
98views more  QUESTA 2006»
13 years 7 months ago
The discrete-time preemptive repeat identical priority queue
Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The customers that cannot tolerate but small delays get serv...
Joris Walraevens, Dieter Fiems, Herwig Bruneel
JFP
2006
67views more  JFP 2006»
13 years 7 months ago
Finger trees: a simple general-purpose data structure
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...
Ralf Hinze, Ross Paterson
EOR
2008
106views more  EOR 2008»
13 years 7 months ago
Analysis of a discrete-time preemptive resume priority buffer
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preempt...
Joris Walraevens, Bart Steyaert, Herwig Bruneel
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 22 days ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...