407 search results - page 70 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
INFOCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
—Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the util...
102
click to vote
IOPADS
1997
14 years 10 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—We consider the power control problem in a timeslotted wireless channel, shared by a finite number of mobiles that transmit to a common base station. The channel betwee...
104
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
102
click to vote
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...