103 search results - page 6 / 21 » On the Competitive Ratio of the Work Function Algorithm for ... |
124
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
176
Voted
COCOON
2004
Springer
15 years 9 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
162
Voted
ALGORITHMICA
2011
14 years 7 months ago
2011
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dual-objective scheduling problems, where the operati...
113
Voted
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
125
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...