4798 search results - page 290 / 960 » A Time for Change |
185
click to vote
IJRR
2011
15 years 1 months ago
2011
This paper presents a novel method for online and incremental appearance-based localization and mapping in a highly dynamic environment. Using position-invariant robust features (...
150
click to vote
ICRA
1998
IEEE
15 years 11 months ago
1998
IEEE
An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...
142
click to vote
ATAL
1995
Springer
15 years 10 months ago
1995
Springer
Autonomousagentsin the real world must be capableof asynchronous goal generation. However, one consequence of this ability is that the agent may generate a substantial number of go...
158
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
156
click to vote
ISVLSI
2006
IEEE
16 years 20 days ago
2006
IEEE
FPGAs have been used for prototyping of ASICs, for low-volume ASIC replacement and for systems requiring in-field hardware upgrades. However, the potential to use dynamic reconfig...