Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
—We consider the situation where N nodes share a common access point. With each node i there is an associated buffer and channel state that change in time. Node i dynamically cho...
Eitan Altaian, Konstantin Avrachenkov, Nicolas Bon...
Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where en...
Ioannis Kamitsos, Lachlan L. H. Andrew, Hongseok K...
Abstract. Training and evaluation of techniques for handwriting recognition and retrieval is a challenge given that it is difficult to create large ground-truthed datasets. This is...