182 search results - page 18 / 37 » Approximation algorithms for time-constrained scheduling on ... |
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
In this work, we analyze the effects of a distributed transmission coordination scheme that is particularly suited for ad hoc networks with the ability to exploit spatially–mult...
ICTCS
2003
Springer
14 years 26 days ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...