5153 search results - page 517 / 1031 » Introduction to Randomized Algorithms |
164
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
173
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
172
click to vote
HCW
1998
IEEE
15 years 11 months ago
1998
IEEE
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...
189
click to vote
STOC
1997
ACM
15 years 11 months ago
1997
ACM
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
168
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...