424 search results - page 10 / 85 » Boosted sampling: approximation algorithms for stochastic op... |
104
click to vote
JAIR
2008
14 years 9 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
QEST
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not be...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
PRL
2007
14 years 9 months ago
2007
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...