Sciweavers

299 search results - page 33 / 60
» DNA Computing for Complex Scheduling Problem
Sort
View
110
Voted
BROADNETS
2006
IEEE
15 years 5 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
92
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
Low-complexity Scheduling Algorithms for Multi-channel Downlink Wireless Networks
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R...
ICCS
2005
Springer
15 years 5 months ago
Super-Scalable Algorithms for Computing on 100, 000 Processors
In the next five years, the number of processors in high-end systems for scientific computing is expected to rise to tens and even hundreds of thousands. For example, the IBM Blu...
Christian Engelmann, Al Geist
COMSUR
2011
221views Hardware» more  COMSUR 2011»
13 years 11 months ago
Computational Intelligence in Wireless Sensor Networks: A Survey
—Wireless sensor networks (WSNs) are networks of distributed autonomous devices that can sense or monitor physical or environmental conditions cooperatively. WSNs face many chall...
Raghavendra V. Kulkarni, A. Forster, Ganesh K. Ven...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 6 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking