Sciweavers

186 search results - page 5 / 38
» Priority Algorithms for the Subset-Sum Problem
Sort
View
TCS
2010
13 years 6 months ago
Randomized priority algorithms
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
Spyros Angelopoulos, Allan Borodin
SWAT
1992
Springer
101views Algorithms» more  SWAT 1992»
13 years 11 months ago
Parallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
Maria Cristina Pinotti, Geppino Pucci
INFOCOM
2003
IEEE
14 years 29 days ago
TCP-LP: A Distributed Algorithm for Low Priority Data Transfer
— Service prioritization among different traffic classes is an important goal for the future Internet. Conventional approaches to solving this problem consider the existing best...
Aleksandar Kuzmanovic, Edward W. Knightly
SCHEDULING
2010
116views more  SCHEDULING 2010»
13 years 6 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
INFOCOM
2002
IEEE
14 years 18 days ago
Travelling Miser Problem
— Various monitoring and performance evaluation tools generate considerable amount of low priority traffic. This information is not always needed in real time, and thus could of...
Yuval Shavitt, David Breitgand, Danny Raz