447 search results - page 31 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
112
click to vote
DC
2010
15 years 3 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
128
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
141
click to vote
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
142
click to vote
ICML
1996
IEEE
15 years 7 months ago
1996
IEEE
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
125
click to vote
DIALM
2004
ACM
15 years 8 months ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...