Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
Kernel learning plays an important role in many machine learning tasks. However, algorithms for learning a kernel matrix often scale poorly, with running times that are cubic in t...
Aspects require access to the join point context in order to select and adapt join points. For this purpose, current aspect-oriented systems offer a large number of pointcut constr...
Mohammed Al-Mansari, Stefan Hanenberg, Rainer Unla...
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...