4565 search results - page 131 / 913 » Time Optimal Self-Stabilizing Algorithms |
AAAI
1993
13 years 11 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
EUROPAR
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...
AAAI
2012
12 years 21 days ago
2012
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...
SODA
1996
ACM
13 years 11 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
TPDS
2002
13 years 10 months ago
2002
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...