In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination w...
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
This paper deals with error estimates for space-time discretizations in the context of nary variational inequalities of rate-independent type. After introducing a general abstract ...
Alexander Mielke, Laetitia Paoli, Adrien Petrov, U...