This HTML5 document contains 39 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/
n18http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/resource/domain/vavai/subjekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F11%3A10107746%21RIV12-MSM-11320___/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
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#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F11%3A10107746%21RIV12-MSM-11320___
rdf:type
skos:Concept n16:Vysledek
rdfs:seeAlso
http://www.mii.lt/olympiads_in_informatics/htm/INFOL078.htm
dcterms:description
Many computer science contests use automatic evaluation of contestants' submissions by running them on test data within given time and space limits. It turns out that the design of contemporary hardware and operating systems, which usually focuses on maximizing throughput, makes consistent implementation of such resource constraints very cumbersome. We discuss possible methods and their properties with emphasis on precision and repeatability of results. Many computer science contests use automatic evaluation of contestants' submissions by running them on test data within given time and space limits. It turns out that the design of contemporary hardware and operating systems, which usually focuses on maximizing throughput, makes consistent implementation of such resource constraints very cumbersome. We discuss possible methods and their properties with emphasis on precision and repeatability of results.
dcterms:title
Fairness of Time Constraints Fairness of Time Constraints
skos:prefLabel
Fairness of Time Constraints Fairness of Time Constraints
skos:notation
RIV/00216208:11320/11:10107746!RIV12-MSM-11320___
n16:predkladatel
n17:orjk%3A11320
n3:aktivita
n15:Z
n3:aktivity
Z(MSM0021620838)
n3:cisloPeriodika
srpen
n3:dodaniDat
n7:2012
n3:domaciTvurceVysledku
n14:1096486
n3:druhVysledku
n9:J
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
199249
n3:idVysledku
RIV/00216208:11320/11:10107746
n3:jazykVysledku
n4:eng
n3:klicovaSlova
precision; time limits; automatic grading
n3:klicoveSlovo
n8:time%20limits n8:precision n8:automatic%20grading
n3:kodStatuVydavatele
LT - Litevská republika
n3:kontrolniKodProRIV
[26CEE365B4E6]
n3:nazevZdroje
Olympiads in Informatics
n3:obor
n11:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:rokUplatneniVysledku
n7:2011
n3:svazekPeriodika
5
n3:tvurceVysledku
Mareš, Martin
n3:zamer
n12:MSM0021620838
s:issn
1822-7732
s:numberOfPages
11
n18:organizacniJednotka
11320