641 search results - page 35 / 129 » On robust online scheduling algorithms |
AMAI
2008
Springer
13 years 8 months ago
2008
Springer
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
ACTA
1998
13 years 7 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
IPPS
1999
IEEE
14 years 6 days ago
1999
IEEE
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— An important milestone for building affordable robots that can become widely popular is to address robustly the Simultaneous Localization and Mapping (SLAM) problem with inexpe...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of ou...