2814 search results - page 33 / 563 » Competitive Analysis of Distributed Algorithms |
158
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
127
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
128
click to vote
ICCAD
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper presents several important enhancements to the recently published multilevel placement package mPL [12]. The improvements include (i) unconstrained quadratic relaxation...
111
click to vote
STACS
2009
Springer
15 years 9 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 ...
137
Voted
CVPR
2001
IEEE
16 years 4 months ago
2001
IEEE
A methodology for the segmentation of successive frames of a video sequence is presented. Traditional methods, treating each frame in isolation, are computationally expensive, ign...