Sciweavers

1040 search results - page 109 / 208
» Rounding algorithms for covering problems
Sort
View
JCO
2006
153views more  JCO 2006»
14 years 9 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
ICASSP
2011
IEEE
14 years 1 months ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
DAC
2009
ACM
15 years 11 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
EMO
2005
Springer
194views Optimization» more  EMO 2005»
15 years 3 months ago
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
Michael Emmerich, Nicola Beume, Boris Naujoks
ALGOSENSORS
2006
Springer
15 years 1 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro