397 search results - page 28 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
AAAI
1997
13 years 9 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
AAAI
2006
13 years 9 months ago
2006
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
ANTSW
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...