220 search results - page 25 / 44 » Minimizing Average Flow-time : Upper and Lower Bounds |
SPAA
2009
ACM
14 years 7 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...
NECO
2007
13 years 6 months ago
2007
An ensemble of stochastic non-leaky integrate-and-fire neurons with global, delayed and excitatory coupling and a small refractory period is analyzed. Simulations with adiabatic ...
JSAC
2006
13 years 7 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...