This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F04%3A00106920%21RIV%2F2005%2FMSM%2FA05005%2FN/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F04%3A00106920%21RIV%2F2005%2FMSM%2FA05005%2FN
rdf:type
skos:Concept n16:Vysledek
dcterms:description
We consider a generalization of the $2$-server problem in which servers have different costs. We prove that, in uniform spaces, a version of the Work Function Algorithm is 5-competitive, and that no better ratio is possible. We also give a 5-competitive randomized, memoryless algorithm for uniform spaces, and a matching lower bound. Článek studuje vážený problém 2 serverů. We consider a generalization of the $2$-server problem in which servers have different costs. We prove that, in uniform spaces, a version of the Work Function Algorithm is 5-competitive, and that no better ratio is possible. We also give a 5-competitive randomized, memoryless algorithm for uniform spaces, and a matching lower bound.
dcterms:title
The weighted 2-server problem Vážený problém 2 serverů The weighted 2-server problem
skos:prefLabel
Vážený problém 2 serverů The weighted 2-server problem The weighted 2-server problem
skos:notation
RIV/67985840:_____/04:00106920!RIV/2005/MSM/A05005/N
n3:strany
289;319
n3:aktivita
n7:P n7:Z
n3:aktivity
P(GA201/01/1195), P(IAA1019401), P(IAA1019901), P(LN00A056), P(ME 103), P(ME 476), Z(AV0Z1019905), Z(MSM 113200005)
n3:cisloPeriodika
2-3
n3:dodaniDat
n17:2005
n3:domaciTvurceVysledku
n15:8679673
n3:druhVysledku
n8:J
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
595099
n3:idVysledku
RIV/67985840:_____/04:00106920
n3:jazykVysledku
n18:eng
n3:klicovaSlova
online algorithms;k-server problem
n3:klicoveSlovo
n4:k-server%20problem n4:online%20algorithms
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[935B66AB36DC]
n3:nazevZdroje
Theoretical Computer Science
n3:obor
n11:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n12:IAA1019901 n12:LN00A056 n12:IAA1019401 n12:ME%20476 n12:GA201%2F01%2F1195 n12:ME%20103
n3:rokUplatneniVysledku
n17:2004
n3:svazekPeriodika
324
n3:tvurceVysledku
Chrobak, M. Sgall, Jiří
n3:zamer
n14:AV0Z1019905 n14:MSM%20113200005
s:issn
0304-3975
s:numberOfPages
31