107 search results - page 7 / 22 » Genetic Search Based on Multiple Mutations |
107
click to vote
ISICA
2007
Springer
15 years 3 months ago
2007
Springer
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
CEC
2008
IEEE
15 years 3 months ago
2008
IEEE
—The conventional K-Means clustering algorithm must know the number of clusters in advance and the clustering result is sensitive to the selection of the initial cluster centroid...
GECCO
2004
Springer
15 years 2 months ago
2004
Springer
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
BMCBI
2006
14 years 9 months ago
2006
Background: With the completion of the genome sequences of human, mouse, and other species and the advent of high throughput functional genomic research technologies such as biomi...