Sciweavers

1792 search results - page 78 / 359
» Improved scheduling in rings
Sort
View
CISS
2008
IEEE
14 years 4 months ago
On wireless network scheduling with intersession network coding
Abstract—Cross-layer optimization including congestion control, routing, and scheduling has shown dramatic throughput improvement over layered designs for wireless networks. In p...
Chih-Chun Wang, Ness B. Shroff
VTC
2010
IEEE
142views Communications» more  VTC 2010»
13 years 8 months ago
Low-Feedback Multiple-Access and Scheduling via Location and Geometry Information
—This paper exploits the use of location information of wireless terminals to improve the performance of a beamforming system and support multiple access. Based on a system provi...
Congzheng Han, Matthew Webb, Angela Doufexi, Mark ...
ICALP
2009
Springer
14 years 4 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
ICPP
2009
IEEE
14 years 4 months ago
Improving Resource Availability by Relaxing Network Allocation Constraints on Blue Gene/P
— High-end computing (HEC) systems have passed the petaflop barrier and continue to move toward the next frontier of exascale computing. As companies and research institutes con...
Narayan Desai, Darius Buntinas, Daniel Buettner, P...
AIPS
2006
13 years 11 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith