1933 search results - page 214 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
138
click to vote
WCNC
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract— VCP suffers from a relatively low speed of convergence and exhibits biased fairness in moderate bandwidth high delay networks due to utilizing an insufficient amount o...
118
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
112
click to vote
SIAMMAX
2010
14 years 11 months ago
2010
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
135
click to vote
AAAI
2007
15 years 6 months ago
2007
We describe a point-based policy iteration (PBPI) algorithm for infinite-horizon POMDPs. PBPI replaces the exact policy improvement step of Hansen’s policy iteration with point...
105
click to vote
SWAT
1990
Springer
15 years 8 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...