Sciweavers

424 search results - page 24 / 85
» Boosted sampling: approximation algorithms for stochastic op...
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Model-free reinforcement learning as mixture learning
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
Nikos Vlassis, Marc Toussaint
IOR
2010
71views more  IOR 2010»
13 years 4 months ago
Stochastic Root Finding and Efficient Estimation of Convex Risk Measures
Reliable risk measurement is a key problem for financial institutions and regulatory authorities. The current industry standard Value-at-Risk has several deficiencies. Improved ri...
Jörn Dunkel, Stefan Weber
AUSAI
2004
Springer
14 years 28 days ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
ENVSOFT
2007
258views more  ENVSOFT 2007»
13 years 7 months ago
Optimal groundwater monitoring design using an ant colony optimization paradigm
Groundwater long-term monitoring (LTM) is required to assess the performance of groundwater remediation and human being health risk at post-closure sites where groundwater contami...
Yuanhai Li, Amy B. Chan Hilton
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
13 years 2 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner