Sciweavers

402 search results - page 5 / 81
» Probability, Parallelism and the State Space Exploration Pro...
Sort
View
COLT
2008
Springer
13 years 9 months ago
Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains
We propose a model-based learning algorithm, the Adaptive Aggregation Algorithm (AAA), that aims to solve the online, continuous state space reinforcement learning problem in a de...
Andrey Bernstein, Nahum Shimkin
AAAI
2008
13 years 10 months ago
Reducing Particle Filtering Complexity for 3D Motion Capture using Dynamic Bayesian Networks
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
Cédric Rose, Jamal Saboune, François...
CHARME
2005
Springer
106views Hardware» more  CHARME 2005»
14 years 1 months ago
Error Detection Using BMC in a Parallel Environment
In this paper, we explore a parallelization of BMC based on state space partitioning. The parallelization is accomplished by executing multiple instances of BMC independently from ...
Subramanian K. Iyer, Jawahar Jain, Mukul R. Prasad...
SIAMSC
2010
159views more  SIAMSC 2010»
13 years 6 months ago
Parameter and State Model Reduction for Large-Scale Statistical Inverse Problems
A greedy algorithm for the construction of a reduced model with reduction in both parameter and state is developed for efficient solution of statistical inverse problems governed b...
Chad Lieberman, Karen Willcox, Omar Ghattas
IJCAI
2007
13 years 9 months ago
State Space Search for Risk-Averse Agents
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
Patrice Perny, Olivier Spanjaard, Louis-Xavier Sto...