|
|
|
||
|
Major goals, basic methods and software tools of experimental algorithmics. An illustration of using statistical methods in
experimental studies of algorithm behavior. Sampling methods and simulation of data sets for experiments with algorithms.
Individual students' project: the experimental study of some algorithm. Basic knowledge of statistics is required.
Last update: Katedry Tajemník (22.04.2010)
|
|
||
|
Zápočet se uděluje za vypracování semestrální práce, účast na cvičení se nevyžaduje. Charakter zápočtu umožňuje jeho opakování. Zápočet je nutnou podmínkou pro zkoušku. Last update: Koubková Alena, RNDr., CSc. (10.10.2017)
|
|
||
|
Antoch, J., Vorlíčková, D.: Vybrané metody statistické analýzy dat. Academia, Praha, 1992.
Demetrescu, C., Italiano, G. F.: What do we learn from experimental algorithmics? Proc. MFCS´00, Lecture Notes in Comp. Sci. 1893, 36-51, Springer-Verlag 2000
Komárková, L., Komárek, A., Bína, V.: Základy analýzy dat a statistického úsudku s příklady v R. Oeconomia, Praha, 2007. Last update: Koubková Alena, RNDr., CSc. (04.04.2014)
|
|
||
|
Předmět nemá zkoušku v klasické podobě. Známka je odvozena od úrovně odevzdané semestrální práce. Last update: Koubková Alena, RNDr., CSc. (10.10.2017)
|
|
||
|
Experimental algorithmics and its relation to the theoretical analysis of algorithms.
Software systems for the experimental analysis of algorithms: libraries of efficient implementations, test sets (generators), tools for vizualization and animation.
A survey of statistical methods for working with experimental data: A random sample from normal distribution, parameter estimates and tests of hypotheses about parameters, methods for determination of the necessary sample size. Sequential analysis. Tests of normality, influence of non-normality on the results, robust methods. Tests of independence.
Obtaining data for experiments with algorithms, random generators, methods for sampling from existing collections.
Software systems for statistical data analysis.
Examples of experimental analysis of the time complexity of algorithms (sorting, graph algorithms, hashing and others), interpretation of results and comparison with theoretical results.
Individual elaboration of an experimental study of behavior of some algorithm (depending on the student's own choice). Last update: Koubková Alena, RNDr., CSc. (04.04.2014)
|