Sciweavers

548 search results - page 29 / 110
» Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Sort
View
DCC
2005
IEEE
14 years 8 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
AAAI
2000
13 years 10 months ago
Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
Laura Barbulescu, Jean-Paul Watson, L. Darrell Whi...
GECCO
2005
Springer
114views Optimization» more  GECCO 2005»
14 years 2 months ago
Exploiting disruption aversion to control code bloat
The authors employ multiple crossovers as a novel natural extension to crossovers as a mixing operator. They use this as a framework to explore the ideas of code growth. Empirical...
Jason Stevens, Robert B. Heckendorn, Terence Soule
IWANN
2009
Springer
14 years 3 months ago
Data Mining in Complex Diseases Using Evolutionary Computation
Abstract. A new algorithm is presented for finding genotype-phenotype association rules from data related to complex diseases. The algorithm was based on Genetic Algorithms, a tech...
Vanessa Aguiar, Jose A. Seoane, Ana Freire, Cristi...
ANOR
2005
93views more  ANOR 2005»
13 years 9 months ago
Evolutionary Approaches to DNA Sequencing with Errors
In the paper, two evolutionary approaches to the general DNA sequencing problem, assuming both negative and positive errors in the spectrum, are compared. The older of them is base...
Jacek Blazewicz, Fred Glover, Marta Kasprzak