478 search results - page 30 / 96 » A simple expected running time analysis for randomized |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
FOCS
1999
IEEE
14 years 23 days ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
GLOBECOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— Quickest detection is applied in the spectrum sensing of cognitive radio systems when multiple secondary users collaborate with limited communication time slots. When t...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
FMCO
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We describe the algorithmic and implementation ideas behind a tool, Orion, for finding common programming errors in C and C++ programs using static code analysis. We aim...