Sciweavers

548 search results - page 60 / 110
» Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Sort
View
CIBCB
2007
IEEE
14 years 29 days ago
Hybrid Architecture for Accelerating DNA Codeword Library Searching
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
Qinru Qiu, Daniel J. Burns, Qing Wu, Prakash Mukre
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
14 years 19 days ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
TIP
2002
179views more  TIP 2002»
13 years 8 months ago
Unsupervised image classification, segmentation, and enhancement using ICA mixture models
An unsupervised classification algorithm is derived by modeling observed data as a mixture of several mutually exclusive classes that are each described by linear combinations of i...
Te-Won Lee, Michael S. Lewicki
TEC
2002
152views more  TEC 2002»
13 years 8 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck
ISSTA
2004
ACM
14 years 2 months ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...