58 search results - page 2 / 12 » A Fixed-Length Subset Genetic Algorithm for the p-Median Pro... |
SGAI
2004
Springer
13 years 10 months ago
2004
Springer
In Wrapper based feature selection, the more states that are visited during the search phase of the algorithm the greater the likelihood of finding a feature subset that has a high...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
GECCO
1999
Springer
13 years 9 months ago
1999
Springer
The Commonality-Based Crossover Framework has been presented as a general model for designing problem specific operators. Following this model, the Common Features/Random Sample ...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
WSC
2007
13 years 7 months ago
2007
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...