1040 search results - page 119 / 208 » Rounding algorithms for covering problems |
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
JEI
2007
14 years 9 months ago
2007
Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window co...
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents the integration between a co-operative co-evolutionary genetic algorithm (CCGA) and four evolutionary multiobjective optimisation algorithms (EMOAs): a multi-ob...
ICCCN
2008
IEEE
15 years 4 months ago
2008
IEEE
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
COREGRID
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the problem of atomic commit in transactional database systems built on top of Distributed Hash Tables. Therefore we present a framework for DHTs to provide strong d...