352 search results - page 16 / 71 » On the convergence of the power series algorithm |
112
Voted
COLT
2008
Springer
15 years 2 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
121
Voted
CIAC
2010
Springer
15 years 4 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
126
click to vote
COMCOM
2007
15 years 8 days ago
2007
This paper presents a new algorithm for jointly optimal control of session rate, link attempt rate, and link power in contention based MultiHop Wireless Networks. Formulating the ...
96
Voted
DAGSTUHL
2007
15 years 1 months ago
2007
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...
78
Voted
FOCS
1994
IEEE
15 years 4 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...