Sciweavers

1068 search results - page 3 / 214
» On Space Bounded Server Algorithms
Sort
View
108
Voted
ISAAC
2010
Springer
216views Algorithms» more  ISAAC 2010»
14 years 11 months ago
Fractal Parallelism: Solving SAT in Bounded Space and Time
Denys Duchier, Jérôme Durand-Lose, Ma...
131
Voted
INFOCOM
1996
IEEE
15 years 5 months ago
Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...
Dimitrios Stiliadis, Anujan Varma
107
Voted
ICALP
2003
Springer
15 years 6 months ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe
94
Voted
COCO
2005
Springer
89views Algorithms» more  COCO 2005»
15 years 6 months ago
Better Time-Space Lower Bounds for SAT and Related Problems
Ryan Williams
57
Voted
SODA
2003
ACM
88views Algorithms» more  SODA 2003»
15 years 2 months ago
Lower bounds for embedding edit distance into normed spaces
Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr ...