599 search results - page 55 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
104
click to vote
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a new approach to reconstruct the shape of a 3D object or scene from a set of calibrated images. The central idea of our method is to combine the topological flexibilit...
129
click to vote
EC
2011
14 years 4 months ago
2011
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...