657 search results - page 30 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Energy conservation is drawing increasing attention in data networking. One school of thought believes that a dominant amount of energy saving comes from turning off network ele...
STOC
2005
ACM
15 years 5 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
103
click to vote
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
90
Voted
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
117
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...