Results 11 to 20 of about 216,568 (279)
Faster sorting algorithms discovered using deep reinforcement learning. [PDF]
Mankowitz DJ +29 more
europepmc +2 more sources
Optimal Algorithms for Sorting Permutations with Brooms
Sorting permutations with various operations has applications in genetics and computer interconnection networks where an operation is specified by its generator set. A transposition tree T=(V,E) is a spanning tree over n vertices v1,v2,…vn.
Indulekha Thekkethuruthel Sadanandan +1 more
doaj +1 more source
Parallel String Sample Sort [PDF]
We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we propose string ...
J. Kärkkäinen +9 more
core +3 more sources
Parallel Computing for Sorting Algorithms
The expanding use of multi-processor supercomputers has made a significant impact on the speed and size of many problems. The adaptation of standard Message Passing Interface protocol (MPI) has enabled programmers to write portable and efficient codes ...
Baghdad Science Journal
doaj +1 more source
Approximation Algorithms for Sorting λ-Permutations by λ-Operations
Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the ...
Guilherme Henrique Santos Miranda +3 more
doaj +1 more source
Engineering Parallel String Sorting [PDF]
We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we first propose ...
Bingmann, Timo +2 more
core +3 more sources
Adaptive Shivers Sort: An Alternative Sorting Algorithm [PDF]
We present a new sorting algorithm, called adaptive ShiversSort , that exploits the existence of monotonic runs for sorting efficiently partially sorted data. This algorithm is a variant of the well-known algorithm TimSort , which is the sorting algorithm used in standard libraries of ...
openaire +3 more sources
Parallel Multidimensional Lookahead Sorting Algorithm
This paper presents a new parallel structured lookahead multidimensional sorting algorithm. Our algorithm can be based on any sequential sorting algorithm. The amount of parallelism can be controlled using several parameters such as the number of threads,
Fayez Gebali +4 more
doaj +1 more source
SETNDS: A SET-Based Non-Dominated Sorting Algorithm for Multi-Objective Optimization Problems
Non-dominated sorting, used to find pareto solutions or assign solutions to different fronts, is a key but time-consuming process in multi-objective evolutionary algorithms (MOEAs).
Lingling Xue, Peng Zeng, Haibin Yu
doaj +1 more source
A taxonomy of parallel sorting [PDF]
TR 84-601In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and file sorting algorithms. We analyze the evolution of research on parallel sorting, from the earliest sorting networks to the shared memory ...
Bitton, Dina +3 more
core +1 more source

