526 search results - page 37 / 106 » Efficient Algorithms for Online Decision Problems |
133
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. For large state-space Markovian Decision Problems MonteCarlo planning is one of the few viable approaches to find near-optimal solutions. In this paper we introduce a new...
125
Voted
ALGORITHMICA
2002
15 years 3 months ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
143
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
161
Voted
CCGRID
2009
IEEE
15 years 4 months ago
2009
IEEE
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
174
Voted
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...