176 search results - page 1 / 36 » Optimal Sampling Strategies in Quicksort |
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
It is well known that the performance of quicksort can be improved by selecting the median of a sample of elements as the pivot of each partitioning stage. For large samples the pa...
ESA
2004
Springer
13 years 11 months ago
2004
Springer
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...
GECCO
2011
Springer
12 years 9 months ago
2011
Springer
This paper introduces mirrored sampling into evolution strategies (ESs) with weighted multi-recombination. Two further heuristics are introduced: pairwise selection selects at mos...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
We explore several fundamental questions at the intersection of sampling theory and information theory. In particular, we study how capacity is affected by a given sampling mechan...
FOCI
2007
IEEE
13 years 9 months ago
2007
IEEE
Abstract-- In this paper, we empirically analyze the convergence behavior of evolutionary algorithms (evolution strategies