Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
We explore runtime mechanisms and policies for scheduling dynamic multi-grain parallelism on heterogeneous multi-core processors. Heterogeneous multi-core processors integrate con...
Filip Blagojevic, Dimitrios S. Nikolopoulos, Alexa...
Robotic manipulators on non-inertial platforms, such as ships, have to endure large inertial forces due to the non-inertial motion of the platform. When the non-inertial platform...
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...