220 search results - page 8 / 44 » Minimizing Average Flow-time : Upper and Lower Bounds |
ACTA
2005
13 years 6 months ago
2005
In online square packing, squares of different sizes arrive online and need to be packed into unit squares which are called bins. The goal is to minimize the number of bins used. ...
NIPS
2004
13 years 8 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined ...
ISLPED
1996
ACM
13 years 11 months ago
1996
ACM
In this paper, we present a new statistical technique for estimation of average power dissipation in digital circuits. Present statistical techniques estimate the average power ba...
SPAA
2005
ACM
14 years 8 days ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...