196 search results - page 6 / 40 » New Algorithms for Optimal Online Checkpointing |
SODA
1998
ACM
13 years 8 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
TASLP
2008
13 years 7 months ago
2008
This paper presents a novel online relevant set algorithm for a linearly-scored block sequence translation model. The key component is a new procedure to directly optimize the glob...
ICRA
2005
IEEE
14 years 29 days ago
2005
IEEE
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
NIPS
2008
13 years 8 months ago
2008
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...