Sciweavers

548 search results - page 74 / 110
» Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 8 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
SIGSOFT
2010
ACM
13 years 5 months ago
Directed test suite augmentation: techniques and tradeoffs
Test suite augmentation techniques are used in regression testing to identify code elements affected by changes and to generate test cases to cover those elements. Our preliminary...
Zhihong Xu, Yunho Kim, Moonzoo Kim, Gregg Rotherme...
BIBE
2006
IEEE
123views Bioinformatics» more  BIBE 2006»
14 years 1 months ago
Isolation and Visualization of Codon Usage Biases
While genomic sequencing projects have proved an abundant source of information for biological studies ranging from the molecular to the ecological in scale, much of the informati...
Douglas W. Raiford, Dan E. Krane, Travis E. Doom, ...
CEC
2005
IEEE
14 years 1 months ago
A quantitative approach for validating the building-block hypothesis
The building blocks are common structures of high-quality solutions. Genetic algorithms often assume the building-block hypothesis. It is hypothesized that the high-quality solutio...
Chatchawit Aporntewan, Prabhas Chongstitvatana
CIDM
2009
IEEE
14 years 2 months ago
Ensemble member selection using multi-objective optimization
— Both theory and a wealth of empirical studies have established that ensembles are more accurate than single predictive models. Unfortunately, the problem of how to maximize ens...
Tuve Löfström, Ulf Johansson, Henrik Bos...