The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
To navigate reliably in indoor environments, a mobile robot must know where it is. This includes both the ability of globally localizing the robot from scratch, as well as trackin...
Frank Dellaert, Wolfram Burgard, Dieter Fox, Sebas...
In this paper we present a non parametric density-based data reduction technique designed to be used in robust parameter estimation problems. Existing approaches are focused on red...
Selecting a set of features which is optimal for a given task is a problem which plays an important role in a wide variety of contexts including pattern recognition, adaptive cont...