4843 search results - page 795 / 969 » The Shortcut Problem - Complexity and Approximation |
135
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
128
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
148
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
141
Voted
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Given a classification problem, our goal is to find a low-dimensional linear transformation of the feature vectors which retains information needed to predict the class labels. We...
122
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Typical web sessions can be hijacked easily by a network eavesdropper in attacks that have come to be designated "sidejacking." The rise of ubiquitous wireless networks,...