Sciweavers

20 search results - page 1 / 4
» Comparing global and local mutations on bit strings
Sort
View
GECCO
2008
Springer
119views Optimization» more  GECCO 2008»
13 years 5 months ago
Comparing global and local mutations on bit strings
Benjamin Doerr, Thomas Jansen, Christian Klein
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
13 years 11 months ago
An extended mutation concept for the local selection based differential evolution algorithm
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
Jani Rönkkönen, Jouni Lampinen
PRIB
2009
Springer
13 years 9 months ago
Syntactic Pattern Recognition Using Finite Inductive Strings
A syntactic pattern recognition technique is described based upon a mathematical principle associated with finite sequences of symbols. The technique allows for fast recognition of...
Paul S. Fisher, Howard Fisher, Jinsuk Baek, Cleopa...
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 6 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
ISICA
2007
Springer
13 years 10 months ago
Fast Multi-swarm Optimization with Cauchy Mutation and Crossover Operation
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
Qing Zhang, Changhe Li, Yong Liu, Lishan Kang