Sciweavers

2174 search results - page 291 / 435
» On the Brittleness of Evolutionary Algorithms
Sort
View
TEC
2010
112views more  TEC 2010»
15 years 1 months ago
Population-Based Algorithm Portfolios for Numerical Optimization
In this paper, we consider the scenario that a population-based algorithm is applied to a numerical optimization problem and a solution needs to be presented within a given time bu...
Fei Peng, Ke Tang, Guoliang Chen, Xin Yao
CEC
2009
IEEE
15 years 11 months ago
Memetic algorithm with Local search chaining for large scale continuous optimization problems
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
Daniel Molina, Manuel Lozano, Francisco Herrera
EC
2010
157views ECommerce» more  EC 2010»
15 years 6 months ago
Memetic Algorithms for Continuous Optimisation Based on Local Search Chains
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
Daniel Molina, Manuel Lozano, Carlos García...
BMCBI
2007
233views more  BMCBI 2007»
15 years 6 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
16 years 1 months ago
Using a distance metric to guide PSO algorithms for many-objective optimization
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
Upali K. Wickramasinghe, Xiaodong Li