Topics
algorithmMusic genre
In the paper a k-server problem with parallel requests where several servers can also be located on one point is considered. We show that a HARMONIC_p k-server algorithm is competitive against an adaptive online adversary in case of unit distances
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
\u3cp\u3eThe generalized k-server problem is a far-reaching extension of the k-server problem with s...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
In the paper a k-server problem with parallel requests where several servers can also be located on ...
In this paper we consider a generalized k-server problem with parallel requests where several serve...
In this paper the (randomized) compound Harmonic algorithm for solving the generalized k-server prob...
In this paper we consider k-server problems with parallel requests where several servers can also be...
We consider the server algorithm, called HARMONIC, that always moves the servers with probabilities ...
In this paper the compound work function algorithm for solving the generalized k-server problem is p...
AbstractWe consider the server algorithm, called HARMONIC, that always moves the servers with probab...
We study a variant of the k-server problem, the infinite server problem, in which infinitely many se...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
We study a variant of the k-server problem, the infinite server problem, in which infinitely many se...
In the online k-server problem, an algorithm controls k mobile servers in a metric space. One by one...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
\u3cp\u3eThe generalized k-server problem is a far-reaching extension of the k-server problem with s...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
In the paper a k-server problem with parallel requests where several servers can also be located on ...
In this paper we consider a generalized k-server problem with parallel requests where several serve...
In this paper the (randomized) compound Harmonic algorithm for solving the generalized k-server prob...
In this paper we consider k-server problems with parallel requests where several servers can also be...
We consider the server algorithm, called HARMONIC, that always moves the servers with probabilities ...
In this paper the compound work function algorithm for solving the generalized k-server problem is p...
AbstractWe consider the server algorithm, called HARMONIC, that always moves the servers with probab...
We study a variant of the k-server problem, the infinite server problem, in which infinitely many se...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
We study a variant of the k-server problem, the infinite server problem, in which infinitely many se...
In the online k-server problem, an algorithm controls k mobile servers in a metric space. One by one...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
\u3cp\u3eThe generalized k-server problem is a far-reaching extension of the k-server problem with s...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
Add to ORKG