4843 search results - page 577 / 969 » The Shortcut Problem - Complexity and Approximation |
190
click to vote
VLDB
1999
ACM
15 years 9 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
146
click to vote
AIPS
2009
15 years 6 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
175
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
132
click to vote
NA
2010
14 years 11 months ago
2010
The defect of a continuous approximate solution to an ODE is the amount by which that approximation fails to satisfy the ODE. A number of studies have explored the use of asymptot...
158
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...