Results 11 to 20 of about 1,744,388 (246)
Optimal Algorithms for Sorting Permutations with Brooms
Algorithms, 2022 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 +2 more sources
Applying Genetic Programming to the Problem of Term Weight Algorithms [PDF]
, 2000 This article investigates the use of the technique of Genetic Programming to the generation of term weight algorithms. It represents an initial study into attempting to reproduce standard algorithms and to evolving new algorithms based on user rankings ...
Wade, Steve +2 more
core +4 more sources
Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors [PDF]
, 2023 We provide and study several algorithms for sorting an array of n comparable distinct elements subject to probabilistic comparison errors. In this model, the comparison of two elements returns the wrong answer according to a fixed probability, p_e < 1/2,
Afshar, Ramtin +3 more
core +1 more source
Parallel Computing for Sorting Algorithms
مجلة بغداد للعلوم, 2014 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
Parallel Multidimensional Lookahead Sorting Algorithm
IEEE Access, 2019 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
Integrating Pareto Optimization into Dynamic Programming
Algorithms, 2016 Pareto optimization combines independent objectives by computing the Pareto front of the search space, yielding a set of optima where none scores better on all objectives than any other.
Thomas Gatter +2 more
doaj +1 more source
Approximation Algorithms for Sorting λ-Permutations by λ-Operations
Algorithms, 2021 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
Journal of Kufa for Mathematics and Computer, 2011 Sorting has been a profound area for the algorithmic researchers and many resources are invested to suggest more works for sorting algorithms. For this purpose, many existing sorting algorithms were observed in terms of the efficiency of the algorithmic ...
NIDHAL . K EL ABBADI +1 more
doaj +1 more source
SETNDS: A SET-Based Non-Dominated Sorting Algorithm for Multi-Objective Optimization Problems
Applied Sciences, 2020 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
Bicomponent sorting algorithms
, 2023 The possibilities of improving sorting time parameters through preprocessing by stochastic sorting were investigated. The hypothesis that two-component stochastic + classical sorting outperforms classic one-component sorting in terms of time efficiency ...
Halanin, K. K. +4 more
core