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...
Abstract. Optimistic execution techniques are widely used in the field of parallel discrete event simulation. In this paper we discuss the use of optimism as a technique for paral...
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
In robot navigation tasks, the representation of the surrounding world plays an important role, especially in reinforcement learning approaches. This work presents a qualitative r...
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...