Sciweavers

2260 search results - page 249 / 452
» A new algorithm for clustering search results
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
16 years 21 days ago
A leader-based parallel cross entropy algorithm for MCP
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
Zhanhua Bai, Qiang Lv
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 7 months ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi
CEC
2008
IEEE
16 years 1 months ago
A Fast Bacterial Swarming Algorithm for high-dimensional function optimization
—A novel Fast Bacterial Swarming Algorithm (FBSA) for high-dimensional function optimization is presented in this paper. The proposed algorithm combines the foraging mechanism of...
Ying Chu, Hua Mi, Huilian Liao, Zhen Ji, Q. H. Wu
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 10 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 10 months ago
Identification of weak motifs in multiple biological sequences using genetic algorithm
Recognition of motifs in multiple unaligned sequences provides an insight into protein structure and function. The task of discovering these motifs is very challenging because mos...
Topon Kumar Paul, Hitoshi Iba