Sciweavers

2814 search results - page 33 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
WADS
2009
Springer
298views Algorithms» more  WADS 2009»
14 years 4 months ago
A Comparison of Performance Measures for Online Algorithms
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...
Joan Boyar, Sandy Irani, Kim S. Larsen
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 10 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
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...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ICCAD
2003
IEEE
141views Hardware» more  ICCAD 2003»
14 years 3 months ago
An Enhanced Multilevel Algorithm for Circuit Placement
This paper presents several important enhancements to the recently published multilevel placement package mPL [12]. The improvements include (i) unconstrained quadratic relaxation...
Tony F. Chan, Jason Cong, Tim Kong, Joseph R. Shin...
STACS
2009
Springer
14 years 4 months ago
Economical Caching
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 ...
Matthias Englert, Heiko Röglin, Jacob Spö...
CVPR
2001
IEEE
14 years 12 months ago
Evolving Image Segmentations for the Analysis of Video Sequences
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...
A. A. Clark, Barry T. Thomas