4843 search results - page 159 / 969 » The Shortcut Problem - Complexity and Approximation |
107
click to vote
SIAMCO
2002
15 years 2 months ago
2002
The Markov chain approximation method is a widely used, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in continuous time, for...
125
click to vote
PAMI
2011
14 years 10 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
106
click to vote
SODA
2010
ACM
16 years 17 days ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
110
click to vote
ALT
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
144
click to vote
DCOSS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...