Sciweavers

5580 search results - page 11 / 1116
» Randomized priority algorithms
Sort
View
VLDB
1989
ACM
72views Database» more  VLDB 1989»
15 years 1 months ago
Priority in DBMS Resource Scheduling
- In this paper, we addressthe problem of priority scheduling in a databasemanagement system. We start by investigating the architectural consequences of adding priority to a DBMS....
Michael J. Carey, Rajiv Jauhari, Miron Livny
SCHEDULING
2010
116views more  SCHEDULING 2010»
14 years 8 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
75
Voted
SODA
2012
ACM
185views Algorithms» more  SODA 2012»
13 years 1 days ago
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
Timothy M. Chan, Elyot Grant, Jochen Könemann...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 1 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
INFOCOM
2007
IEEE
15 years 3 months ago
Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
Hao Wang, Bill Lin