Sciweavers

1368 search results - page 118 / 274
» Removing the Genetics from the Standard Genetic Algorithm
Sort
View
ISMB
1994
14 years 11 months ago
High Speed Pattern Matching in Genetic Data Base with Reconfigurable Hardware
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...
Eric Lemoine, Joël Quinqueton, Jean Sallantin
EVOW
2006
Springer
15 years 1 months ago
Evolving the Structure of the Particle Swarm Optimization Algorithms
A new model for evolving the structure of a Particle Swarm Optimization (PSO) algorithm is proposed in this paper. The model is a hybrid technique that combines a Genetic Algorithm...
Laura Diosan, Mihai Oltean
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 3 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
EOR
2008
200views more  EOR 2008»
14 years 10 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...
FGCS
2010
119views more  FGCS 2010»
14 years 8 months ago
Characterizing fault tolerance in genetic programming
Evolutionary Algorithms, including Genetic Programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. ...
Daniel Lombraña Gonzalez, Francisco Fern&aa...