7150 search results - page 213 / 1430 » An Approximation Algorithm for Approximation Rank |
181
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Reinforcement learning algorithms can become unstable when combined with linear function approximation. Algorithms that minimize the mean-square Bellman error are guaranteed to co...
204
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
178
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
192
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
161
click to vote
INFOCOM
2007
IEEE
16 years 25 days ago
2007
IEEE
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...