Real-world machine learning applications may have requirements beyond accuracy, such
as fast evaluation times and interpretability. In particular, guaranteed monotonicity of the …

Programming problems can be solved in a multitude of functionally correct ways, but the
quality of these solutions (eg readability, maintainability) can vary immensely. When code …

The central new technical contribution presented by this dissertation is a reflective
framework for partial evaluation and rewriting, already used to compile a code generator for …

Shuffling is the process of rearranging a sequence of elements into a random order such
that any permutation occurs with equal probability. It is an important building block in a …

We study sorting algorithms based on randomized round-robin comparisons. Specifically,
we study Spin-the-bottle sort, where comparisons are unrestricted, and Annealing sort …

Choosing the right method to sort numbers has a huge effect on how quickly a computer can
process a task. The most used sorting algorithms today have been discovered years ago …

We introduce the algorithm ExpoSort, a groundbreaking method that sorts an array of n
numbers in a spectacularly inefficient Θ (2n) time. ExpoSort proudly claims the title of the first …

The aim of the bachelor thesis was to provide an extensive overview of sorting algorithms
ranging from the pessimal and quadratic time solutions, up to those, that are currently being …

In today's data-driven world, algorithm selection for fundamental tasks such as sorting is of
paramount importance. Harnessing machine learning techniques to adaptively choose the …

YAGI is a declarative and prodedural programming language based on Situation Calculus
and Golog. The language allows the user to model the target domain as a set of actions …