766 search results - page 90 / 154 » Online Variance Minimization |
139
Voted
PC
2008
15 years 3 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...
140
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
124
click to vote
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 ...
165
click to vote
SIAMCOMP
2012
13 years 6 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
153
Voted
ISVC
2009
Springer
15 years 8 months ago
2009
Springer
Foregrounds extracted from the background, which are intended to be used as photorealistic avatars for simulators in a variety of virtual worlds, should satisfy the following four ...