Olympiads in Informatics Logo

OLYMPIADS IN INFORMATICS
International Journal

Main Page
Editorial Board
Instructions to Authors


Contents
Author Index
Papers in Production

OLYMPIADS IN INFORMATICS, 2011, Vol. 5, 92-102
© Institute of Mathematics and Informatics,

ISSN 1822-7732

Fairness of Time Constraints

Martin MARES

Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University Malostranské nám. 25, 118 00 Praha 1, Czech Republic E-mail: mares@kam.mff.cuni.cz

Abstract

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.

Keywords:

automatic grading, time limits, precision


PDFTo preview full article text in PDF format click here

Get Free ReaderYou could obtain free Acrobat Reader from Adobe


TopTop Copyright © Olympiads in Informatics, Vilnius University Institute of Mathematics and Informatics, 2013