1451 search results - page 34 / 291 » A Clustering Based Niching Method for Evolutionary Algorithm... |
GECCO
2005
Springer
14 years 28 days ago
2005
Springer
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
TSMC
2008
13 years 7 months ago
2008
Differential evolution (DE) has emerged as one of the fast, robust, and efficient global search heuristics of current interest. This paper describes an application of DE to the aut...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
BIBE
2007
IEEE
14 years 1 months ago
2007
IEEE
—The rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important, the challenge is to identify subfamilies of evolut...
ICML
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper we propose a novel clustering algorithm based on maximizing the mutual information between data points and clusters. Unlike previous methods, we neither assume the d...