3874 search results - page 346 / 775 » Approximation Algorithms for k-hurdle Problems |
162
click to vote
IPL
2007
15 years 5 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
155
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
135
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
148
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
125
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...