Sciweavers

2260 search results - page 309 / 452
» A new algorithm for clustering search results
Sort
View
ICDT
2001
ACM
124views Database» more  ICDT 2001»
15 years 11 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 10 months ago
Pairwise sequence comparison for fitness evaluation in evolutionary structural software testing
Evolutionary algorithms are among the metaheuristic search methods that have been applied to the structural test data generation problem. Fitness evaluation methods play an import...
H. Turgut Uyar, A. Sima Etaner-Uyar, A. Emre Harma...
BMCBI
2007
166views more  BMCBI 2007»
15 years 6 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
DCC
2008
IEEE
16 years 6 months ago
Williamson matrices up to order 59
A recent result of Schmidt has brought Williamson matrices back into the spotlight. In this paper a new algorithm is introduced to search for hard to find Williamson matrices. We ...
Wolf H. Holzmann, Hadi Kharaghani, Behruz Tayfeh-R...
GECCO
2005
Springer
147views Optimization» more  GECCO 2005»
15 years 12 months ago
Unbiased tournament selection
Tournament selection is a popular form of selection which is commonly used with genetic algorithms, genetic programming and evolutionary programming. However, tournament selection...
Artem Sokolov, Darrell Whitley