Sciweavers

7015 search results - page 1093 / 1403
» Approximation algorithms for co-clustering
Sort
View
ATAL
2009
Springer
15 years 11 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...
142
Voted
ATAL
2009
Springer
15 years 11 months ago
Achieving goals in decentralized POMDPs
Coordination of multiple agents under uncertainty in the decentralized POMDP model is known to be NEXP-complete, even when the agents have a joint set of goals. Nevertheless, we s...
Christopher Amato, Shlomo Zilberstein
ATAL
2009
Springer
15 years 11 months ago
Transfer via soft homomorphisms
The field of transfer learning aims to speed up learning across multiple related tasks by transferring knowledge between source and target tasks. Past work has shown that when th...
Jonathan Sorg, Satinder Singh
126
Voted
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
15 years 11 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
15 years 11 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
« Prev « First page 1093 / 1403 Last » Next »