Sciweavers

739 search results - page 55 / 148
» Sorting Algorithms
Sort
View
DCC
2008
IEEE
14 years 8 months ago
Huffman Coding with Non-sorted Frequencies
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...
Shmuel Tomi Klein, Dana Shapira
CORR
2000
Springer
100views Education» more  CORR 2000»
13 years 8 months ago
Perfect simulation from the Quicksort limit distribution
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional...
Luc Devroye, James Allen Fill, Ralph Neininger
GECCO
2005
Springer
288views Optimization» more  GECCO 2005»
14 years 2 months ago
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...
Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto
MST
1998
91views more  MST 1998»
13 years 8 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson
MST
2002
128views more  MST 2002»
13 years 8 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter