Sciweavers

6562 search results - page 329 / 1313
» Noetherianity and Combination Problems
Sort
View
WSC
2008
15 years 9 months ago
On step sizes, stochastic shortest paths, and survival probabilities in Reinforcement Learning
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
Abhijit Gosavi
WSC
2007
15 years 9 months ago
Subset selection and optimization for selecting binomial systems applied to supersaturated design generation
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...
Ning Zheng, Theodore Allen
AIMSA
2008
Springer
15 years 8 months ago
A Hybrid Approach to Distributed Constraint Satisfaction
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
David Lee, Inés Arana, Hatem Ahriz, Kit-Yin...
ECAI
2008
Springer
15 years 8 months ago
Exploiting locality of interactions using a policy-gradient approach in multiagent learning
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
Francisco S. Melo
MVA
2007
160views Computer Vision» more  MVA 2007»
15 years 8 months ago
Probabilistic Motion Segmentation of Videos for Temporal Super Resolution
A novel scheme is proposed for achieving motion segmentation in low-frame rate videos, with application to temporal super resolution. Probabilistic generative models are commonly ...
Arasanathan Thayananthan, Masahiro Iwasaki, Robert...