874 search results - page 89 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
ORL
2000
14 years 9 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
119
click to vote
TMC
2010
14 years 4 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
128
click to vote
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
CLUSTER
2006
IEEE
15 years 4 months ago
2006
IEEE
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...