1632 search results - page 168 / 327 » Sublinear Time Algorithms for Metric Space Problems |
137
Voted
SODA
1998
ACM
15 years 5 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
141
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...
139
Voted
ALT
2007
Springer
15 years 10 months ago
2007
Springer
This paper deals with the problem of making predictions in the online mode of learning where the dependence of the outcome yt on the signal xt can change with time. The Aggregating...
146
click to vote
ARCS
2008
Springer
15 years 6 months ago
2008
Springer
: The task of the creatures in the "creatures' exploration problem" is to visit all empty cells in an environment with a minimum number of steps. We have analyzed th...
151
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...