21. Verifying time complexity of Turing machinesDavid Gajser, 2015, doctoral dissertation Keywords: Turing machine, relativization, NP-completeness, crossing sequence, decidability, lower bound, time complexity, running time, linear time Full text (file, 881,68 KB) |
22. Markov and hidden Markov models in microinsuranceGregor Fabjan, 2017, master's thesis Keywords: multistate models, Markov models, hidden Markov models, dishonest transition function, life insurance, Chapman-Kolmogorov equation, Baum-Welch algorithm, microinsurance, Allianz, Egypt Post, Smith-Wilson algorithm, Matlab, insurance, machine learning, case study Full text (file, 2,78 MB) |
|
24. Statistical comparison of machine learning algorithms with respect to multiple performance measuresLara Dular, 2018, master's thesis/paper Keywords: comparison of machine learning algorithms, pairwise comparison, comparative studies, multiple performance measures, Wilcoxon signed-rank test, Friedman test, Pareto front Full text (file, 1,07 MB) |
|
|
|
|
|
|