Sciweavers

1830 search results - page 77 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 1 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
15 years 1 months ago
Alternative evolutionary algorithms for evolving programs: evolution strategies and steady state GP
In contrast with the diverse array of genetic algorithms, the Genetic Programming (GP) paradigm is usually applied in a relatively uniform manner. Heuristics have developed over t...
L. Darrell Whitley, Marc D. Richards, J. Ross Beve...
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
15 years 3 months ago
Designing resilient networks using a hybrid genetic algorithm approach
As high-speed networks have proliferated across the globe, their topologies have become sparser due to the increased capacity of communication media and cost considerations. Relia...
Abdullah Konak, Alice E. Smith
GECCO
2003
Springer
111views Optimization» more  GECCO 2003»
15 years 3 months ago
An Adaptive Penalty Scheme for Steady-State Genetic Algorithms
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is a...
Helio J. C. Barbosa, Afonso C. C. Lemonge
EUROGP
2004
Springer
145views Optimization» more  EUROGP 2004»
15 years 3 months ago
Toward an Alternative Comparison between Different Genetic Programming Systems
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and sepa...
Nguyen Xuan Hoai, Robert I. McKay, Daryl Essam, Hu...