Sciweavers

2031 search results - page 44 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
ICAART
2010
INSTICC
14 years 5 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
13 years 10 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 11 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
JC
2006
97views more  JC 2006»
13 years 8 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings II
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Stephan Dahlke, Erich Novak, Winfried Sickel
DAGSTUHL
2004
13 years 9 months ago
Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Erich Novak, Stephan Dahlke, Winfried Sickel