Sciweavers

4255 search results - page 42 / 851
» Cover
Sort
View
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
14 years 1 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
GIS
2006
ACM
14 years 8 months 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
ICALP
2009
Springer
14 years 7 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
MOBIHOC
2003
ACM
14 years 7 months ago
Connected sensor cover: self-organization of sensor networks for efficient query execution
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...
Himanshu Gupta, Samir R. Das, Quinyi Gu
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 1 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn