Results 1 to 10 of about 57,373 (301)
Sequence sort: A new non-dominated sorting algorithm for evolutionary multi-objective optimization [PDF]
Scientific ReportsNon-dominated sorting is a crucial component of multi-objective evolutionary algorithms. However, most existing non-dominated sorting algorithms suffer from low computational efficiency and high complexity, especially as the number of objectives ...
YunFei Yi, Wang Chen, YingJie Shi
doaj +2 more sources
Empirical Evaluation of Unoptimized Sorting Algorithms on 8-Bit AVR Arduino Microcontrollers [PDF]
SensorsResource-constrained sensor nodes in Internet-of-Things (IoT) and embedded sensing applications frequently rely on low-cost microcontrollers, where even basic algorithmic choices directly impact latency, energy consumption, and memory footprint.
Julia Golonka, Filip Krużel
doaj +2 more sources
Optimal Algorithms for Sorting Permutations with Brooms [PDF]
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
Performance evaluation of GPU-based parallel sorting algorithms [PDF]
PLoS ONESorting can be approached in two main ways: sequentially and in parallel. In sequential sorting, data is processed in a single-threaded manner, which can be slow for large datasets.
Mohammed Alaa Ala’anzy +3 more
doaj +3 more sources
Desnakification of mesh sorting algorithms [PDF]
, 1994 In all recent near-optimal sorting algorithms for meshes, the packets are sorted with respect to some snake-like indexing. In this paper we present deterministic algorithms for sorting with respect to the more natural row-major indexing. For 1-1 sorting on an n × n mesh, we give an algorithm that runs in 2 · n+o(n) steps, matching the distance bound ...
Sibeyn, J., Jop F. Sibeyn
openaire +6 more sources
Optimal inter-electrode distances for maximizing single unit yield per electrode in neural recordings [PDF]
Microsystems & NanoengineeringState-of-the-art high-density multielectrode arrays enable the recording of simultaneous spiking activity from hundreds of neurons. Although significant efforts have been dedicated to enhancing neural recording devices and developing more efficient ...
Domokos Meszéna +10 more
doaj +2 more sources
Edumatic, 2023 Sorting algorithms are crucial in data processing, particularly for integer data. However, as the number of integers to be sorted increases, the sorting algorithm takes longer to complete, especially for algorithms with O(n2) complexity.
Risqi Pradana Aryanto +2 more
doaj +1 more source
Sorting algorithm acceleration based on CPU-FPGA heterogeneous system
Dianzi Jishu Yingyong, 2022 Traditional sorting methods are mainly implemented in software serial mode, including bubble sorting, selective sorting and so on. These algorithms often use sequential comparison, and the operation time complexity is relatively high.
Kou Yuanbo +3 more
doaj +1 more source
This article presents a detailed analysis of sorting algorithms, highlighting their implementations, efficiencies and practical applications. Through extensive benchmarking with datasets of varying sizes (10,000 to 100,000 elements) and characteristics (random, partially ordered, reverse ordered), we demonstrate that hybrid algorithms like Timsort ...
Abibou, Ramatou
openaire +4 more sources
Systematic review and exploration of new avenues for sorting algorithm
International Journal of Information Management Data Insights, 2021 Sorting plays a crucial role in almost all algorithms that support data science applications. A quadratic sorting algorithm is one in which the time taken for the algorithm to sort a dataset grows as the square of the size of the dataset. This paper aims
Anand Zutshi, Dipanjan Goswami
doaj +1 more source