Sciweavers

1830 search results - page 39 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
ICDT
2009
ACM
121views Database» more  ICDT 2009»
15 years 10 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 3 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
15 years 3 months ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel
SWAT
1992
Springer
116views Algorithms» more  SWAT 1992»
15 years 1 months ago
Sorting Multisets Stably in Minimum Space
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
Jyrki Katajainen, Tomi Pasanen
STRINGOLOGY
2004
14 years 11 months ago
Sorting suffixes of two-pattern strings
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
Frantisek Franek, William F. Smyth