641 search results - page 22 / 129 » On robust online scheduling algorithms |
EOR
2008
13 years 8 months ago
2008
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
SIGECOM
2004
ACM
14 years 1 months ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
COLING
2010
13 years 2 months ago
2010
Sentence-level aligned parallel texts are important resources for a number of natural language processing (NLP) tasks and applications such as statistical machine translation and ...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we describe a resource matcher (RM) developed for the on-line resource matching in heterogeneous grid environments. RM is based on the principles of Evolutionary Al...