Title
Scheduling for Speed Bounded Processors
Abstract
On the Internet, there are advertisements (ads) of different kinds: image, text, video and other specially marked objects that are distinct from the underlying content of the page. There is an industry behind the management of such ads, and they face ...
Year
DOI
Venue
2008
10.1007/978-3-540-70575-8_34
ICALP
Keywords
Field
DocType
underlying content,marked object,different kind,speed bounded processors,energy efficient,online algorithm,linguistics,scheduling
Online algorithm,Mathematical optimization,Computer science,Scheduling (computing),Flow time,Throughput,Earliest deadline first scheduling,Dynamic speed scaling,Competitive analysis,Bounded function
Conference
Volume
ISSN
Citations 
5125
0302-9743
64
PageRank 
References 
Authors
2.53
22
4
Name
Order
Citations
PageRank
Nikhil Bansal13043230.41
Ho-Leung Chan247125.23
Tak-Wah Lam31860164.96
Lap-Kei Lee440621.59