291 search results - page 11 / 59 » Implementation with a bounded action space |
ECRTS
2005
IEEE
14 years 2 months ago
2005
IEEE
We present a wait-free protocol for the single-writer, multiple-reader problem in small-memory, embedded real-time systems. We analytically establish that our protocol requires le...
RTCSA
2000
IEEE
14 years 5 days ago
2000
IEEE
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
WSC
2000
13 years 10 months ago
2000
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
3DIM
2005
IEEE
14 years 2 months ago
2005
IEEE
Iterative Closest Point (ICP) -based tracking works well when the interframe motion is within the ICP minimum well space. For large interframe motions resulting from a limited sen...