We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
Abstract— In this paper we consider the problem of optimizing over the switching times for a multi-modal dynamic system when the complete cost-to-go is not available. The instant...