Sciweavers

6693 search results - page 965 / 1339
» On an anytime algorithm for control
Sort
View
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
15 years 10 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
15 years 10 months ago
Dynamics in Network Interaction Games
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
Martin Hoefer, Siddharth Suri
ATAL
2009
Springer
15 years 10 months ago
Online exploration in least-squares policy iteration
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
Lihong Li, Michael L. Littman, Christopher R. Mans...
ATAL
2009
Springer
15 years 10 months ago
MABLE: a framework for learning from natural instruction
The Modular Architecture for Bootstrapped Learning Experiments (MABLE) is a system that is being developed to allow humans to teach computers in the most natural manner possible: ...
Roger Mailler, Daniel Bryce, Jiaying Shen, Ciaran ...
ATAL
2009
Springer
15 years 10 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...