Sciweavers

3120 search results - page 513 / 624
» A parameter-less genetic algorithm
Sort
View
120
Voted
RECOMB
2003
Springer
16 years 2 months ago
Whole-genome comparative annotation and regulatory motif discovery in multiple yeast species
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...
Manolis Kamvysselis, Nick Patterson, Bruce Birren,...
132
Voted
OOPSLA
2009
Springer
15 years 9 months ago
Towards automation of iteration planning
Iterations are time-boxed periods with an intended outcome that is often a set of implemented requirements. Iterations are part of most common software development lifecycle model...
Jonas Helming, Maximilian Koegel, Zardosht Hodaie
139
Voted
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 6 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
GECCO
2008
Springer
196views Optimization» more  GECCO 2008»
15 years 3 months ago
ADANN: automatic design of artificial neural networks
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
Juan Peralta, Germán Gutiérrez, Arac...
137
Voted
CANDC
2006
ACM
15 years 2 months ago
Dealing with repetitions in sequencing by hybridization
DNA sequencing by hybridization (SBH) induces errors in the biochemical experiment. Some of them are random and disappear when the experiment is repeated. Others are systematic, i...
Jacek Blazewicz, Fred Glover, Marta Kasprzak, Wojc...