Results 1 to 10 of about 277,393 (334)

NK-SORTING ALGORITHM

open access: yesJournal 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   +2 more sources

Fast parallel sorting algorithms [PDF]

open access: bronzeCommunications of the ACM, 1978
A parallel bucket-sort algorithm is presented that requires time O (log n ) and the use of n processors. The algorithm makes use of a technique that requires more space than the product of processors and time. A realistic model is used in which no memory contention is permitted.
D. S. Hirschberg
openaire   +3 more sources

Efficient Detection of Defective Parts with Acoustic Resonance Testing Using Synthetic Training Data

open access: yesApplied Sciences, 2022
Analyzing eigenfrequencies by acoustic resonance testing enables a fast screening of components regarding structural defects. The eigenfrequencies of each specific part depend on the general geometric and material properties, including tolerable part-to ...
Matthias Heinrich   +2 more
doaj   +1 more source

Using Machine Learning to Grade the Mango’s Quality Based on External Features Captured by Vision System

open access: yesApplied Sciences, 2020
Nowadays, mangoes and other fruits are classified according to human perception of low productivity, which is a poor quality of classification. Therefore, in this study, we suggest a novel evaluation of internal quality focused on external features of ...
Nguyen Truong Minh Long   +1 more
doaj   +1 more source

Sorting algorithm acceleration based on CPU-FPGA heterogeneous system

open access: yesDianzi 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

Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: Extended abstract. [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2007
We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a string of 0's, and
Svante Janson
doaj   +1 more source

Modelling and Optimisation of Vacuum Collection System for Cruise Ship Kitchen Garbage

open access: yesPolish Maritime Research, 2020
Pollution of the marine environment by ship garbage is an urgent problem to be solved at home and abroad. The ship kitchen garbage vacuum collection system is a new environmental protection scheme for garbage disposal.
Jun Du, Ruonan Li, Xin Wu, Hang Zhao
doaj   +1 more source

Systematic review and exploration of new avenues for sorting algorithm

open access: yesInternational 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

AN IMPROVED CIRCLE SORT ALGORITHM

open access: yesActa Electrotechnica et Informatica, 2020
The circle sort algorithm was introduced in 2005 by Bezemer and Olufem, and it is still not completely researched. The experiments show that the algorithm is comparable with the Shell sort algorithm. Its complexity is still not definitely determined. This paper gives optimized circle sort algorithm, which proved to be up to 25% faster than the original
Informatics, Pavlinska , Hr Varazdin   +1 more
openaire   +3 more sources

Adaptive Shivers Sort: An Alternative Sorting Algorithm [PDF]

open access: yesACM Transactions on Algorithms, 2020
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

Home - About - Disclaimer - Privacy