Sciweavers

447 search results - page 15 / 90
» Approximation Algorithms for the Discrete Time-Cost Tradeoff...
Sort
View
DCOSS
2006
Springer
15 years 3 months ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei
83
Voted
ICALP
2005
Springer
15 years 5 months ago
Linear Time Algorithms for Clustering Problems in Any Dimensions
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
Amit Kumar, Yogish Sabharwal, Sandeep Sen
80
Voted
COMPGEOM
2009
ACM
15 years 6 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
116
Voted
CORR
2012
Springer
235views Education» more  CORR 2012»
13 years 7 months ago
An Incremental Sampling-based Algorithm for Stochastic Optimal Control
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
Vu Anh Huynh, Sertac Karaman, Emilio Frazzoli
106
Voted
COMPGEOM
2000
ACM
15 years 4 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk