Results 1  10
of
265,946
The Harmonic kServer Algorithm is Competitive
 Journal of the ACM
, 1991
"... The kserver problem is a generalization of the paging problem, and is the most studied problem in the area of competitive online problems. The Harmonic algorithm is a very natural and simple randomized algorithm for the kserver problem. We give a simple proof that the Harmonic kserver algorith ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
The kserver problem is a generalization of the paging problem, and is the most studied problem in the area of competitive online problems. The Harmonic algorithm is a very natural and simple randomized algorithm for the kserver problem. We give a simple proof that the Harmonic kserver
Competitive kServer Algorithms
 Journal of Computer and System Sciences
, 1990
"... In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture [MMS] up to the competitive ratio. The best previous result for general metric spaces was a 3server randomized competitive algorithm [BKT] and a nonconstructive ..."
Abstract

Cited by 58 (4 self)
 Add to MetaCart
In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture [MMS] up to the competitive ratio. The best previous result for general metric spaces was a 3server randomized competitive algorithm [BKT] and a non
Competitive kServer Algorithms
, 1991
"... In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture up to the competitive ratio, The best previous result for general metric spaces was a threeserver randomized competitive algorithm and a nonconstructive proof t ..."
Abstract
 Add to MetaCart
In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture up to the competitive ratio, The best previous result for general metric spaces was a threeserver randomized competitive algorithm and a nonconstructive proof
On the kServer Conjecture
 Journal of the ACM
, 1995
"... We prove that the work function algorithm for the kserver problem has competitive ratio at most 2k \Gamma 1. Manasse, McGeoch, and Sleator [24] conjectured that the competitive ratio for the kserver problem is exactly k (it is trivially at least k); previously the best known upper bound was ex ..."
Abstract

Cited by 113 (6 self)
 Add to MetaCart
We prove that the work function algorithm for the kserver problem has competitive ratio at most 2k \Gamma 1. Manasse, McGeoch, and Sleator [24] conjectured that the competitive ratio for the kserver problem is exactly k (it is trivially at least k); previously the best known upper bound
The Harmonic Algorithm for kserver Problem
"... The online kserver problem was introduced by Manasse. We are given initial locations of k servers in a matric space in which there is a distant function d.Requests for service at point {xt} come in over time. Immediately after the t th request is received, one of the servers must be moved from ..."
Abstract
 Add to MetaCart
The online kserver problem was introduced by Manasse. We are given initial locations of k servers in a matric space in which there is a distant function d.Requests for service at point {xt} come in over time. Immediately after the t th request is received, one of the servers must be moved from
The OnLine KServer Problem
 Computational Linguistics
, 1997
"... We survey the research performed during the last few years on the online kserver problem over metric spaces. A variety of algorithms are presented  both deterministic and randomized  and their performance is studied in the framework of competitive analysis. Restrictions of the problem to ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We survey the research performed during the last few years on the online kserver problem over metric spaces. A variety of algorithms are presented  both deterministic and randomized  and their performance is studied in the framework of competitive analysis. Restrictions of the problem
Online algorithms and the kserver conjecture
, 1994
"... The Work Function Algorithm, a natural algorithm for the kserver problem, is shown to have competitive ratio at most 2k − 1 for all metric spaces. It is also shown that the kserver conjecture, which states that there is an online algorithm for the kserver problem with competitive ratio k, holds ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
The Work Function Algorithm, a natural algorithm for the kserver problem, is shown to have competitive ratio at most 2k − 1 for all metric spaces. It is also shown that the kserver conjecture, which states that there is an online algorithm for the kserver problem with competitive ratio k, holds
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
The Distributed kServer Problem  A Competitive Distributed Translator for kServer Algorithms
, 1992
"... We consider the kserver problem [23] in a distributed setting. ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We consider the kserver problem [23] in a distributed setting.
CostAware WWW Proxy Caching Algorithms
 IN PROCEEDINGS OF THE 1997 USENIX SYMPOSIUM ON INTERNET TECHNOLOGY AND SYSTEMS
, 1997
"... Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and nonparameterized fash ..."
Abstract

Cited by 544 (6 self)
 Add to MetaCart
parameterized fashion for high performance. Tracedriven simulations show that with the appropriate cost definition, GreedyDualSize outperforms existing web cache replacement algorithms in many aspects, including hit ratios, latency reduction and network cost reduction. In addition, GreedyDualSize can potentially
Results 1  10
of
265,946