Topics
algorithmMusic genre
The optimal off-line algorithm for solving the k-server problem is usually implemented by network flows. In this paper, we first propose certain modifications to each step of the original network-flow implementation. Next, by experiments we demonstrate that the proposed modifications improve the speed of the algorithm. Finally, we investigate how similar ideas for improvement can also be applied to some related on-line algorithms
In a k-server routing problem k ≥ 1 servers move in a metric space in order to visit specified point...
In this thesis we present a distributed algorithm designed for peer-to-peer (P2P) networks that can ...
We study the k-server problem when the off-line algorithm has fewer than k servers. We give two uppe...
The optimal off-line algorithm for solving the k-server problem is usually implemented by network fl...
In this paper we study a modified work function algorithm (WFA) for solving the on-line k-server pro...
In this paper we consider the bicriteria version of the well-known k-server problem in which the co...
AbstractIn this paper we consider the bicriteria version of the well-known k-server problem in which...
The k-server problem is that of planning the motion of k mobile servers on the vertices of a graph u...
by Chi-ming Wat.Thesis (M.Phil.)--Chinese University of Hong Kong, 1995.Includes bibliographical ref...
This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. Th...
Abstract In this paper we consider the bicriteria version of the well-known k -server problem in whi...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. Th...
In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
AbstractWe study several interesting variants of the k-server problem. In the CNN problem, one serve...
In a k-server routing problem k ≥ 1 servers move in a metric space in order to visit specified point...
In this thesis we present a distributed algorithm designed for peer-to-peer (P2P) networks that can ...
We study the k-server problem when the off-line algorithm has fewer than k servers. We give two uppe...
The optimal off-line algorithm for solving the k-server problem is usually implemented by network fl...
In this paper we study a modified work function algorithm (WFA) for solving the on-line k-server pro...
In this paper we consider the bicriteria version of the well-known k-server problem in which the co...
AbstractIn this paper we consider the bicriteria version of the well-known k-server problem in which...
The k-server problem is that of planning the motion of k mobile servers on the vertices of a graph u...
by Chi-ming Wat.Thesis (M.Phil.)--Chinese University of Hong Kong, 1995.Includes bibliographical ref...
This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. Th...
Abstract In this paper we consider the bicriteria version of the well-known k -server problem in whi...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. Th...
In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
AbstractWe study several interesting variants of the k-server problem. In the CNN problem, one serve...
In a k-server routing problem k ≥ 1 servers move in a metric space in order to visit specified point...
In this thesis we present a distributed algorithm designed for peer-to-peer (P2P) networks that can ...
We study the k-server problem when the off-line algorithm has fewer than k servers. We give two uppe...
Add to ORKG