32 search results - page 5 / 7 » On Minimizing the Maximum Flow Time in the Online Dial-a-Rid... |
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...
GLVLSI
2010
IEEE
14 years 16 days ago
2010
IEEE
Meeting the temperature constraints and reducing the hot-spots are critical for achieving reliable and efficient operation of complex multi-core systems. The goal of thermal mana...
PC
2008
13 years 7 months ago
2008
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...
VLDB
2004
ACM
14 years 7 months ago
2004
ACM
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
ICALP
2005
Springer
14 years 29 days ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...