5138 search results - page 538 / 1028 » Randomized Algorithms for 3-SAT |
197
click to vote
SI3D
2003
ACM
16 years 8 days ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
175
click to vote
SPAA
2003
ACM
16 years 8 days 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...
185
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...
185
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...
200
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...