2168 search results - page 157 / 434 » Randomized Algorithms and Complexity Theory |
127
Voted
TOC
2008
15 years 3 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
132
click to vote
SMA
2010
ACM
15 years 3 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
105
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
142
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
140
Voted
GECCO
2009
Springer
15 years 1 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...