356 search results - page 43 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— This paper focuses on time-optimal path tracking, which involves planning of robot motions along prescribed geometric paths. Starting from a discretized convex reformulation of...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
ICPP
2007
IEEE
14 years 1 months ago
2007
IEEE
The real-time image forming in future, high-end synthetic aperture radar systems is an example of an application that puts new demands on computer architectures. The initial quest...
RTSS
2002
IEEE
14 years 16 days ago
2002
IEEE
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
SWAT
2010
Springer
14 years 20 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...