Sciweavers

1830 search results - page 26 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
78
Voted
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 2 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
72
Voted
GECCO
2005
Springer
177views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolving next generation signal compression and reconstruction transforms via genetic algorithms
Ongoing research has established a new methodology for using genetic algorithms [2] to evolve forward and inverse transforms that significantly reduce quantization error in recons...
Frank W. Moore, Patrick Marshall
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
14 years 11 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
GECCO
2006
Springer
447views Optimization» more  GECCO 2006»
15 years 1 months ago
Candlestick stock analysis with genetic algorithms
Candlestick analysis, a form of stock market technical analysis, is well suited for use with a genetic search algorithm. This paper explores an implementation of marrying these tw...
Peter Belford
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
15 years 1 months ago
Using Genetic Algorithms with Asexual Transposition
Traditional Genetic Algorithms (GA) use crossover and mutation as the main genetic operators to achieve population diversity. Previous work using a biologically inspired genetic o...
Anabela Simões, Ernesto Costa