31 search results - page 2 / 7 » Sampled fictitious play for approximate dynamic programming |
119
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
128
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
141
click to vote
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
113
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
A dynamic model of a multiagent system defines a probability distribution over possible system behaviors over time. Alternative representations for such models present tradeoffs i...
108
click to vote
SAGA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper, a Stochastic Dynamic Facility Location Problem (SDFLP) is formulated. In the first part, an exact solution method based on stochastic dynamic programming ...