Sciweavers

2152 search results - page 295 / 431
» Backward-chaining evolutionary algorithms
Sort
View
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 4 months ago
Theoretical analysis of diversity mechanisms for global exploration
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...
Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudh...
167
Voted
IANDC
2011
148views more  IANDC 2011»
14 years 10 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
151
Voted
CEC
2009
IEEE
15 years 8 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 3 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 3 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