Sciweavers

Share
727 search results - page 1 / 146
» Sorting and selection on dynamic data
Sort
View
TCS
2011
8 years 2 months ago
Sorting and selection on dynamic data
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian...
CGO
2004
IEEE
8 years 11 months ago
A Dynamically Tuned Sorting Library
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
Xiaoming Li, María Jesús Garzar&aacu...
JDCTA
2010
92views more  JDCTA 2010»
8 years 2 months ago
Several Incomplete Sort Algorithms for Getting the Median Value
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
Fuguo Dong
IPPS
2000
IEEE
8 years 11 months ago
Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks using a conceptual torus mesh. We ported HeteroSort to a 16-node Beowulf cluster with a central switch architec...
Pamela Yang, Timothy M. Kunau, Bonnie Holte Bennet...
IPPS
1999
IEEE
8 years 11 months ago
Reconfigurable Parallel Sorting and Load Balancing: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optim...
Emmett Davis, Bonnie Holte Bennett, Bill Wren, Lin...
books