Sciweavers

450 search results - page 13 / 90
» The Complexity of Computing Minimal Unidirectional Covering ...
Sort
View
ISCC
2005
IEEE
146views Communications» more  ISCC 2005»
15 years 5 months ago
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
— Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the networ...
Jean Carle, Antoine Gallais, David Simplot-Ryl
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 6 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
GIS
2006
ACM
16 years 25 days ago
Generalization of land cover maps by mixed integer programming
We present a novel method for the automatic generalization of land cover maps. A land cover map is composed of areas that collectively form a tessellation of the plane and each ar...
Jan-Henrik Haunert, Alexander Wolff
JC
2011
87views more  JC 2011»
14 years 6 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
SAC
2008
ACM
14 years 11 months ago
Test generation and minimization with "basic" statecharts
Model-based testing as a black-box testing technique has grown in importance. The models used represent the relevant features of the system under consideration (SUC), and can also...
Fevzi Belli, Axel Hollmann