Sciweavers

554 search results - page 55 / 111
» Approximability of OFDMA Scheduling
Sort
View
LCTRTS
2000
Springer
15 years 1 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
INFOCOM
2008
IEEE
15 years 4 months ago
Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
Xin Wang, J. J. Garcia-Luna-Aceves
ICALP
2007
Springer
15 years 4 months ago
Mechanism Design for Fractional Scheduling on Unrelated Machines
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
George Christodoulou, Elias Koutsoupias, Annam&aac...
LCN
2008
IEEE
15 years 4 months ago
Efficient power management for Wireless Sensor Networks: A data-driven approach
—Providing energy-efficient continuous data collection services is of paramount importance to Wireless Sensor Network (WSN) applications. This paper proposes a new power manageme...
MingJian Tang, Jinli Cao, Xiaohua Jia
AAAI
2007
15 years 3 days ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...