5169 search results - page 39 / 1034 » Locality approximation using time |
128
click to vote
WINET
2010
15 years 17 days ago
2010
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
QUESTA
2006
15 years 2 months ago
2006
Abstract We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over ti...
147
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
127
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
108
click to vote
FMSB
2008
15 years 3 months ago
2008
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...