Sciweavers

1830 search results - page 114 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
15 years 4 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
ICALP
1992
Springer
15 years 2 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
ICES
2003
Springer
151views Hardware» more  ICES 2003»
15 years 3 months ago
Using Genetic Programming and High Level Synthesis to Design Optimized Datapath
This paper presents a methodology to design optimized electronic systems from high abstraction level descriptions. The methodology uses Genetic Programming in addition to high-leve...
Sérgio G. Araújo, Antônio C. M...
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 4 months ago
Genetic-Greedy Hybrid Approach for Topological Active Nets Optimization
In this paper we propose a genetic and greedy algorithm combination for the optimization of the Topological Active Nets (TAN) model. This is a deformable model used for image segme...
José Santos, Óscar Ibáñ...
SIGADA
2004
Springer
15 years 3 months ago
Comparative analysis of genetic algorithm implementations
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...
Robert Soricone, Melvin Neville