2031 search results - page 94 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
COLT
2010
Springer
13 years 6 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Motivated by some crowd motion models in the presence of noise, we consider an optimal control problem governed by the Fokker-Planck equation. We sketch optimality conditions b...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
AAAI
2000
13 years 9 months ago
2000
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
NLP
2000
13 years 11 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...