2957 search results - page 297 / 592 » The Complexity of Polynomial-Time Approximation |
162
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
221
click to vote
ICML
2003
IEEE
15 years 12 months ago
2003
IEEE
Reinforcement learning has been used for training game playing agents. The value function for a complex game must be approximated with a continuous function because the number of ...
186
Voted
KR
1992
Springer
15 years 10 months ago
1992
Springer
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
180
click to vote
APN
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but ...
183
click to vote
WSC
2007
15 years 9 months ago
2007
State-dependent importance sampling (SDIS) has proved to be particularly useful in simulation (specially in rare event analysis of stochastic systems). One approach for designing ...