In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
We present an approach for adaptive scheduling of soft realtime legacy applications (for which no timing information is exposed to the system). Our strategy is based on the combin...
Finding the “best” viewing parameters for a scene is quite difficult but a very important problem. Fully automatic procedures seem to be impossible as the notion of “best...
This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime ...
Nikolaus Hansen, Anne Auger, Raymond Ros, Steffen ...