895 search results - page 90 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
86
Voted
ICDM
2007
IEEE
15 years 2 months ago
2007
IEEE
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
ICB
2007
Springer
15 years 5 months ago
2007
Springer
We present a general biometric hash generation scheme based on vector quantization of multiple feature subsets selected with genetic optimization. The quantization of subsets overc...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
108
click to vote
MFCS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
TEC
2008
14 years 11 months ago
2008
Data mining is most commonly used in attempts to induce association rules from transaction data. Most previous studies focused on binary-valued transaction data. Transaction data i...