Sciweavers

1830 search results - page 18 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
SPIRE
2005
Springer
15 years 3 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
ICPP
1995
IEEE
15 years 1 months ago
Generalized Algorithm for Parallel Sorting on Product Networks
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Antonio Fernández, Nancy Eleser, Kemal Efe
GECCO
2005
Springer
196views Optimization» more  GECCO 2005»
15 years 3 months ago
Providing information from the environment for growing electronic circuits through polymorphic gates
This paper deals with the evolutionary design of programs (constructors) that are able to create (n+2)-input circuits from n-input circuits. The growing circuits are composed of p...
Michal Bidlo, Lukás Sekanina
GECCO
2006
Springer
149views Optimization» more  GECCO 2006»
15 years 1 months ago
Leveraging domain-expert knowledge in a genetic algorithm for civil engineering design optimization
Hoa Vo, Justin Terada, David Joslin, Jeff Dragovic...