Results 1  10
of
483,567
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
The Kserver problem with distinguishable servers
, 1991
"... This report gives a survey of existing results in the field of online kserver algorithms and presents some new findings. The survey includes optimal online algorithms for k servers on a line or a tree, an optimal online algorithm for 2 servers in any metric space, and an optimal online algorith ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
line algorithm for n − 1 servers in a metric space with n points. The first part of the newer material pertains to the traditional kserver problem. The equivalence of the Tree and Line Potential Functions is discussed. An algorithm is given that works in any finite metric space with a competitiveness
A Metrics Suite for Object Oriented Design
 IEEE Trans. Softw. Eng
, 1994
"... Given the central role that software development plays in the delivery and application of information technology, managers are increasingly focusing on process improvement in the software development area. This demand has spurred the provision of a number of new and/or improved approaches to softwar ..."
Abstract

Cited by 1079 (3 self)
 Add to MetaCart
to software development, with perhaps the most prominent being objectorientation (00). In addition, the focus on process improvement has increased the demand for software measures, or metrics with which to manage the process. The need for such metrics is particularly acute when an organization is adopting a
A PolylogarithmicCompetitive Algorithm for the kServer Problem
"... We give the first polylogarithmiccompetitive randomized online algorithm for the kserver problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log3 n log 2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k − ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We give the first polylogarithmiccompetitive randomized online algorithm for the kserver problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log3 n log 2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k
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
Searching in metric spaces
, 2001
"... The problem of searching the elements of a set that are close to a given query element under some similarity criterion has a vast number of applications in many branches of computer science, from pattern recognition to textual and multimedia information retrieval. We are interested in the rather gen ..."
Abstract

Cited by 432 (38 self)
 Add to MetaCart
The problem of searching the elements of a set that are close to a given query element under some similarity criterion has a vast number of applications in many branches of computer science, from pattern recognition to textual and multimedia information retrieval. We are interested in the rather
DISTRIBUTED SYSTEMS
, 1985
"... Growth of distributed systems has attained unstoppable momentum. If we better understood how to think about, analyze, and design distributed systems, we could direct their implementation with more confidence. ..."
Abstract

Cited by 755 (1 self)
 Add to MetaCart
Growth of distributed systems has attained unstoppable momentum. If we better understood how to think about, analyze, and design distributed systems, we could direct their implementation with more confidence.
Irrelevant Features and the Subset Selection Problem
 MACHINE LEARNING: PROCEEDINGS OF THE ELEVENTH INTERNATIONAL
, 1994
"... We address the problem of finding a subset of features that allows a supervised induction algorithm to induce small highaccuracy concepts. We examine notions of relevance and irrelevance, and show that the definitions used in the machine learning literature do not adequately partition the features ..."
Abstract

Cited by 741 (26 self)
 Add to MetaCart
We address the problem of finding a subset of features that allows a supervised induction algorithm to induce small highaccuracy concepts. We examine notions of relevance and irrelevance, and show that the definitions used in the machine learning literature do not adequately partition the features
The Google File System
 ACM SIGOPS Operating Systems Review
"... We have designed and implemented the Google File System, a scalable distributed file system for large distributed dataintensive applications. It provides fault tolerance while running on inexpensive commodity hardware, and it delivers high aggregate performance to a large number of clients. While ..."
Abstract

Cited by 1470 (2 self)
 Add to MetaCart
We have designed and implemented the Google File System, a scalable distributed file system for large distributed dataintensive applications. It provides fault tolerance while running on inexpensive commodity hardware, and it delivers high aggregate performance to a large number of clients. While
The Cricket LocationSupport System
, 2000
"... This paper presents the design, implementation, and evaluation of Cricket, a locationsupport system for inbuilding, mobile, locationdependent applications. It allows applications running on mobile and static nodes to learn their physical location by using listeners that hear and analyze informatio ..."
Abstract

Cited by 1036 (11 self)
 Add to MetaCart
This paper presents the design, implementation, and evaluation of Cricket, a locationsupport system for inbuilding, mobile, locationdependent applications. It allows applications running on mobile and static nodes to learn their physical location by using listeners that hear and analyze
Results 1  10
of
483,567