Sciweavers

63 search results - page 4 / 13
» Better Huffman Coding via Genetic Algorithm
Sort
View
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
14 years 1 months ago
A doubly distributed genetic algorithm for network coding
We present a genetic algorithm which is distributed in two novel ways: along genotype and temporal axes. Our algorithm first distributes, for every member of the population, a su...
Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muri...
CGO
2005
IEEE
14 years 1 months ago
Optimizing Sorting with Genetic Algorithms
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...
Xiaoming Li, María Jesús Garzar&aacu...
APIN
2000
120views more  APIN 2000»
13 years 7 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
AAAI
2000
13 years 8 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...
CPHYSICS
2006
127views more  CPHYSICS 2006»
13 years 7 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris