Sciweavers

2714 search results - page 244 / 543
» Approximation Schemes for Scheduling
Sort
View
INFOCOM
2000
IEEE
15 years 9 months ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste
SCHEDULING
2008
89views more  SCHEDULING 2008»
15 years 4 months ago
Batch scheduling of step deteriorating jobs
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladi...
INFOCOM
2010
IEEE
15 years 2 months ago
Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model
—Energy conservation is drawing increasing attention in data networking. One school of thought believes that a dominant amount of energy saving comes from turning off network ele...
Matthew Andrews, Antonio Fernández, Lisa Zh...
INFOCOM
2003
IEEE
15 years 9 months ago
Uplink Scheduling in CDMA Packet-Data Systems
Abstract—Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the curre...
Krishnan Kumaran, Lijun Qian
EUROCRYPT
2005
Springer
15 years 10 months ago
Reducing Complexity Assumptions for Statistically-Hiding Commitment
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-...