Sciweavers

257 search results - page 40 / 52
» An optimal algorithm for area minimization of slicing floorp...
Sort
View
EVOW
2007
Springer
13 years 11 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
COMCOM
2007
100views more  COMCOM 2007»
13 years 8 months ago
Sensor replacement using mobile robots
Sensor replacement is important for sensor networks to provide continuous sensing services. Upon sensor node failures, holes (uncovered areas) may appear in the sensing coverage. ...
Yongguo Mei, Changjiu Xian, Saumitra M. Das, Y. Ch...
INFOCOM
2010
IEEE
13 years 6 months ago
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case
Abstract—We consider the power control problem in a timeslotted wireless channel, shared by a finite number of mobiles that transmit to a common base station. The channel betwee...
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, ...
SIAMIS
2011
13 years 2 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 1 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor