4843 search results - page 156 / 969 » The Shortcut Problem - Complexity and Approximation |
111
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
166
click to vote
AAIM
2007
Springer
15 years 9 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
149
click to vote
CALC
2001
Springer
15 years 7 months ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
116
click to vote
TOMACS
2010
14 years 10 months ago
2010
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
120
click to vote
TON
2010
14 years 10 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...