Sciweavers

493 search results - page 42 / 99
» Final exam scheduler - FES
Sort
View
104
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana
111
Voted
ATAL
2009
Springer
15 years 7 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee
INFOCOM
2005
IEEE
15 years 6 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
ECCC
2000
140views more  ECCC 2000»
15 years 11 days ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
93
Voted
PAAPP
2007
104views more  PAAPP 2007»
15 years 1 days ago
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
Abstract— This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling a...
Wen-Zhan Song, Fenghua Yuan, Richard LaHusen, Behr...