Sciweavers

12264 search results - page 84 / 2453
» Analysis of the rubberband algorithm
Sort
View
FOCS
1990
IEEE
14 years 2 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet
FOGA
1990
13 years 11 months ago
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, a...
David E. Goldberg, Kalyanmoy Deb
COR
2006
122views more  COR 2006»
13 years 10 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
FLAIRS
2006
13 years 11 months ago
Analysis of Galactic Spectra using Noise-Aware Learning Algorithms
We introduce a novel learning algorithm for noise elimination. Our algorithm is based on the re-measurement idea for the correction of erroneous observations and is able to discri...
H. Jair Escalante, Olac Fuentes
SODA
1993
ACM
94views Algorithms» more  SODA 1993»
13 years 11 months ago
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
Alan M. Frieze, A. J. Radcliffe, Stephen Suen