This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We dene a framework for measuring the eciency of an ind...
Joseph M. Hellerstein, Elias Koutsoupias, Christos...