Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

An application of various algorithms for solvimg the k-server problem (CROSBI ID 245935)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Rudec, Tomislav An application of various algorithms for solvimg the k-server problem // Mathematical communications, 1 (2001) (2001), 1; 233-238

Podaci o odgovornosti

Rudec, Tomislav

engleski

An application of various algorithms for solvimg the k-server problem

In the k-server problem one must choose how k mobile servers will serve a sequence of requested points. We are given a metric space M and k servers that move among the points of M, each occupying one point of M. A request (x element of M) appears. To serve x servers move some distance and change positions, after which a point x is occupied by one of the servers. We must serve this request without knowing future requests. our aim is to minimize the global cost of all distances of all moves made. The contribution of this paper is an example of such problem. The problem was posed in 1988. In 1994. the WFA algorithm is proved to be(2k-1) competitive.

on-line computation, servers, algorithms

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

1 (2001) (1)

2001.

233-238

objavljeno

1331-0623

1331-0623

Povezanost rada

Matematika