39 search results - page 3 / 8 » Online Knapsack Revisited |
COCOA
2008
Springer
14 years 19 days ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
This paper presents a novel time-adaptive estimation technique by revisiting the classical Wiener-Hopf equation. Any convex and not necessarily differentiable function can be used...
WAOA
2005
Springer
14 years 4 months ago
2005
Springer
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
GLOBECOM
2008
IEEE
14 years 5 months ago
2008
IEEE
— In this paper, we revisit the problem of multicast tree construction in overlay peer-to-peer networks. We present an iterative online multicast tree construction algorithm for ...