55 search results - page 5 / 11 » Policy Tree: Adaptive Representation for Policy Gradient |
TON
2010
13 years 2 months ago
2010
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...
NIPS
2003
13 years 8 months ago
2003
Recent multi-agent extensions of Q-Learning require knowledge of other agents’ payoffs and Q-functions, and assume game-theoretic play at all times by all other agents. This pap...
IWMMDBMS
1998
13 years 8 months ago
1998
Recent research has shown that near optimal performance can be achieved by adaptive block replacement policies that use user-level hints regarding the block reference pattern. How...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Classically, an approach to the multiagent policy learning supposed that the agents, via interactions and/or by using preliminary knowledge about the reward functions of all playe...