Sciweavers

12257 search results - page 51 / 2452
» Analysis of Algorithms
Sort
View
FOGA
1990
13 years 10 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 9 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...
BCB
2010
138views Bioinformatics» more  BCB 2010»
13 years 4 months ago
Comparative analysis of biclustering algorithms
Biclustering is a very popular method to identify hidden co-regulation patterns among genes. There are numerous biclustering algorithms designed to undertake this challenging task...
Doruk Bozdag, Ashwin S. Kumar, Ümit V. &Ccedi...
FLAIRS
2006
13 years 10 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 10 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