Results 51 to 60 of about 277,393 (334)
Perbandingan Efisiensi Algoritma Sorting dalam Penggunaan Bandwidth
The most used algorithm is the sorting algorithm. There have been many popping sorting algorithms that can be used, in this study researchers took three sorting algorithms namely Insertion Sort, Selection Sort, and Merge Sort.
Desi Anggreani +3 more
doaj +1 more source
Grab control method of food sorting robot based on 3D model
Objective: To solve the problems of poor accuracy and low sorting efficiency of the existing string fruits in robot sorting. Methods: Based on the structure of the high-speed parallel food sorting system, the improved SURF algorithm and the improved ...
XIAO Yao-xing +3 more
doaj +1 more source
Combinatorics of patience sorting piles [PDF]
Despite having been introduced in 1962 by C.L. Mallows, the combinatorial algorithm Patience Sorting is only now beginning to receive significant attention due to such recent deep results as the Baik-Deift-Johansson Theorem that connect it to fields ...
Burstein, Alexander, Lankham, Isaiah
core +3 more sources
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves
We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) element transports.
Franceschini, Gianni, Geffert, Viliam
core +2 more sources
Unraveling LINE‐1 retrotransposition in head and neck squamous cell carcinoma
The novel RetroTest method allows the detection of L1 activation in clinical samples with low DNA input, providing global L1 activity and the identification of the L1 source element. We applied RetroTest to a real‐world cohort of HNSCC patients where we reported an early L1 activation, with more than 60% of T1 patients showing L1 activity.
Jenifer Brea‐Iglesias +12 more
wiley +1 more source
Fast continuous streaming sort in big streaming data environment under fixed-size single storage.
Big streaming data environment concerns a complicated scenario where data to be processed continuously flow into a processing unit and certainly cause a memory overflow problem.
Suluk Chaikhan +2 more
doaj +1 more source
General variable neighborhood search for the multi-AGV scheduling problem with sorting operations
To solve the intractable multiple automatic guided vehicles (AGVs) scheduling problem encountered in the sorting processes of the logistics sorting centers,a large-scale AGV scheduling problem was studied on the basis of considering the sorting time ...
Chao GUO +3 more
doaj +1 more source
Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets Best Order Sort
Many production-grade algorithms benefit from combining an asymptotically efficient algorithm for solving big problem instances, by splitting them into smaller ones, and an asymptotically inefficient algorithm with a very small implementation constant ...
Buzdalov Maxim +3 more
core +1 more source
EMT‐associated bias in the Parsortix® system observed with pancreatic cancer cell lines
The Parsortix® system was tested for CTC enrichment using pancreatic cancer cell lines with different EMT phenotypes. Spike‐in experiments showed lower recovery of mesenchymal‐like cells. This was confirmed with an EMT‐inducible breast cancer cell line.
Nele Vandenbussche +8 more
wiley +1 more source
The article presents a brief description of the features of the IDE of the course "Basis of algorithmization and programming" developed by the laboratory of integrated environments of learning RI IT in Kherson State University.
A. Spivakovsky +3 more
doaj

