7150 search results - page 234 / 1430 » An Approximation Algorithm for Approximation Rank |
178
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
165
click to vote
SIGECOM
2004
ACM
16 years 17 hour ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
180
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
179
click to vote
CCCG
2007
15 years 8 months ago
2007
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
147
click to vote
AAMAS
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...