Sciweavers

61 search results - page 5 / 13
» A Method for Utilizing Diploid Dominance in Genetic Search
Sort
View
CEC
2011
IEEE
12 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
13 years 11 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro
ICPR
2002
IEEE
14 years 9 days ago
Assembly of Puzzles Using a Genetic Algorithm
In this paper, we proposed a method for solving the rectangle piece jigsaw puzzle assembly problem. A shape of a piece is a rectangle, and a picture of a puzzle is only painted in...
Fubito Toyama, Yukihiro Fujiki, Kenji Shoji, Juich...
TIP
1998
103views more  TIP 1998»
13 years 7 months ago
Technique for fractal image compression using genetic algorithm
—A new method for fractal image compression is proposed using genetic algorithm (GA) with elitist model. The self transformability property of images is assumed and exploited in ...
Suman K. Mitra, C. A. Murthy, Malay Kumar Kundu
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
13 years 11 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