Sciweavers

36 search results - page 3 / 8
» Efficient On-the-Fly Algorithms for Partially Observable Tim...
Sort
View
IJCAI
2001
13 years 8 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
14 years 1 months ago
Game Theoretic Control for Robot Teams
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
ATVA
2006
Springer
106views Hardware» more  ATVA 2006»
13 years 11 months ago
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier E...
ROBOCUP
2009
Springer
214views Robotics» more  ROBOCUP 2009»
14 years 2 months ago
Real-Time Ball Tracking in a Semi-automated Foosball Table
In this article a method is proposed for ball tracking using 100 Hz computer vision in a semi-automated foosball table. In this application the behavior of the ball is highly dynam...
Rob Janssen, Jeroen de Best, René van de Mo...
VTC
2008
IEEE
224views Communications» more  VTC 2008»
14 years 1 months ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang