27 search results - page 6 / 6 » A Simple Algorithm for Stable Minimum Storage Merging |
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
COMPGEOM
1994
ACM
13 years 9 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...