356 search results - page 68 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
ICALP
2004
Springer
14 years 27 days 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...
FOCS
2002
IEEE
14 years 14 days ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
SBBD
2008
13 years 9 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
A multi-agent system architecture for coordination of just-in-time production and distribution is presented. The problem to solve is two-fold: first the right amount of resources ...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...