Sciweavers

1830 search results - page 69 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
EUROGP
2004
Springer
15 years 1 months ago
On the Evolution of Evolutionary Algorithms
In this paper we discuss the evolution of several components of a traditional Evolutionary Algorithm, such as genotype to phenotype mappings and genetic operators, presenting a for...
Jorge Tavares, Penousal Machado, Amílcar Ca...
ICEC
1994
107views more  ICEC 1994»
14 years 11 months ago
Genetic Algorithms and Discrete Event Systems: An Application
: In this paper we propose an approach for discrete event systems control optimization, based on the theory developed by Ramadge and Wonham and on the Limited Lookahead Policy stra...
Ricardo R. Gudwin, Fernando A. C. Gomide
NIPS
2008
14 years 11 months ago
Kernelized Sorting
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we...
Novi Quadrianto, Le Song, Alex J. Smola
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
14 years 10 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
AB
2007
Springer
15 years 1 months ago
Prefix Reversals on Binary and Ternary Strings
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper...