Results 21 to 30 of about 185,887 (355)
Performance Analysis of Sorting and Searching Algorithms
In computer science, the efficiency of algorithms is a critical consideration for optimizing performance. The time and space complexity of sorting and searching algorithms, which are essential to a variety of computational tasks, is frequently the basis
Prof.Mrs. Tejaswini.A. Puranik
openalex +3 more sources
A note on limits of sequences of binary trees [PDF]
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a characterization of the ...
Rudolf Grübel
doaj +1 more source
Personalization Sorting Algorithm Based on Interest Attenuation [PDF]
The most currentranking algorithm don’t take users’ interest drifting over time into consideration,which affects the sorting quality.In order to solve this problem,a method ranking algorithm merging user interest attenuation is proposed.In this method ...
WANG Lin,LIU Jiyuan,MA Anjin
doaj +1 more source
AIT-S for Single-Machine Weighted Tardiness Problem [PDF]
This paper concentrates on the newly improved algorithm for solving the single-machine total weighted tardiness (SMTWT) problem, called Algorithm Inspired by Tree and Sorting (AIT-S).
Kacper Petrynski +3 more
doaj +1 more source
A threshold‐based sorting algorithm for dense wireless sensor systems and communication networks
Nowadays, time‐varying and high‐density data of wireless sensor systems and communication networks compel us to propose and realise low‐complexity and time‐efficient algorithms for searching, clustering, and sorting.
Shahriar Shirvani Moghaddam +1 more
doaj +1 more source
Developing a code of practice for literature searching in health sciences: a project description
Introduction: Libraries have provided mediated search services for more than forty years without a practice standard to guide the execution of searches, training of searchers, or evaluation of search performance.
Brooke Ballantyne Scott
doaj +1 more source
Advanced Optimization of Fundamental Searching and Sorting Algorithms
Searching and Sorting are the most important data structure operations, which make easy searching, arranging and locating the information. One of the basic problems of computer science is sorting a list of items and searching elements in the array. There
Jasrat Singh
semanticscholar +1 more source
CloudDBGuard: Enabling Sorting and Searching on Encrypted Data in NoSQL Cloud Databases
Tim Waage, Lena Wiese
openalex +3 more sources
Comparative analysis of database systems dedicated for Android
The article presents a comparative analysis of mobile databases dedicated for Android. The comparative analysis was carried out on the example of a relational SQLite database with selected nonrelational databases: Realm, ObjectBox and SnappyDB ...
Kamil Wałachowski, Grzegorz Kozieł
doaj +1 more source
Single-cell genomics is applied to environmental samples as a method to solve the problems of current metagenomics. However, in the fluorescence-activated cell sorting-based cell isolation and subsequent whole genome amplification, the sorting efficiency
Yohei Nishikawa +10 more
doaj +1 more source

