Sciweavers

1830 search results - page 145 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
15 years 2 months ago
TFBS identification by position- and consensus-led genetic algorithm with local filtering
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
Tak-Ming Chan, Kwong-Sak Leung, Kin-Hong Lee
APIN
2000
120views more  APIN 2000»
14 years 10 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano
GECCO
2003
Springer
107views Optimization» more  GECCO 2003»
15 years 3 months ago
Exploration of a Two Sided Rendezvous Search Problem Using Genetic Algorithms
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
T. Q. S. Truong, A. Stacey
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
15 years 3 months ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 2 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel