Sciweavers

291 search results - page 10 / 59
» Implementation with a bounded action space
Sort
View
CVPR
2004
IEEE
14 years 10 months ago
Efficient Tracking with the Bounded Hough Transform
The Bounded Hough Transform is introduced to track objects in a sequence of sparse range images. The method is based upon a variation of the General Hough Transform that exploits ...
Michael A. Greenspan, Limin Shang, Piotr Jasiobedz...
EWCBR
2008
Springer
13 years 10 months ago
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
Neha Sugandh, Santiago Ontañón, Ashw...
DC
2006
13 years 8 months ago
On the inherent weakness of conditional primitives
Some well-known primitive operations, such as compare-and-swap, can be used, together with read and write, to implement any object in a wait-free manner. However, this paper shows ...
Faith Ellen Fich, Danny Hendler, Nir Shavit
IPPS
2009
IEEE
14 years 3 months ago
Crash fault detection in celerating environments
Failure detectors are a service that provides (approximate) information about process crashes in a distributed system. The well-known “eventually perfect” failure detector, 3P...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
SEFM
2008
IEEE
14 years 3 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...