1830 search results - page 8 / 366 » Optimizing Sorting with Genetic Algorithms |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
STOC
1990
ACM
15 years 1 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
Optimization of the control parameters of genetic algorithms is often a time consuming and tedious task. In this work we take the meta-level genetic algorithm approach to control ...
ISCC
2006
IEEE
15 years 3 months ago
2006
IEEE
Genetic Algorithms are very powerful search methods that are used in different optimization problems. Parallel versions of genetic algorithms are easily implemented and usually in...