Sciweavers

1792 search results - page 320 / 359
» Improved scheduling in rings
Sort
View
JAIR
2007
141views more  JAIR 2007»
14 years 11 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
TWC
2008
129views more  TWC 2008»
14 years 11 months ago
Amplify-and-forward cooperation under interference-limited spatial reuse of the relay slot
1 . Cooperative transmission has emerged as an effective tool to deal with channel impairments. In this work we study the applicability of amplify-and-forward cooperative transmiss...
Adrian Agustin, Josep Vidal
CCR
2004
103views more  CCR 2004»
14 years 11 months ago
Reconsidering wireless systems with multiple radios
The tremendous popularity of wireless systems in recent years has led to the commoditization of RF transceivers (radios) whose prices have fallen dramatically. The lower cost allo...
Paramvir Bahl, Atul Adya, Jitendra Padhye, Alec Wo...
CONCURRENCY
2004
99views more  CONCURRENCY 2004»
14 years 11 months ago
A performance study of job management systems
Job Management Systems (JMSs) efficiently schedule and monitor jobs in parallel and distributed computing environments. Therefore, they are critical for improving the utilization ...
Tarek A. El-Ghazawi, Kris Gaj, Nikitas A. Alexandr...
CORR
2004
Springer
113views Education» more  CORR 2004»
14 years 11 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers