12 search results - page 2 / 3 » Edge Finding for Cumulative Scheduling |
CCGRID
2004
IEEE
13 years 9 months ago
2004
IEEE
In a Computational Grid which consists of many computer clusters, job start time predictions are useful to guide resource selections and balance the workload distribution. However...
INFOCOM
1991
IEEE
13 years 9 months ago
1991
IEEE
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
CONEXT
2007
ACM
13 years 9 months ago
2007
ACM
Data-ferrying disconnection-tolerant networks allow remote rural areas to access the Internet at very low cost, making them viable alternatives to more expensive access technologi...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...