Results 11 to 20 of about 285,472 (282)
Fast computation of trimmed means [PDF]
, 2011 We present two methods of calculating trimmed means without sorting the data in O(n) time. The existing method implemented in major statistical packages relies on sorting, which takes O(n log n) time.
Beliakov, Gleb
core +2 more sources
Adaptive Shivers Sort: An Alternative Sorting Algorithm [PDF]
ACM 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
Exploring Auto-Generation of Network Models With Performance Evaluation Process Algebra
IEEE Access, 2018 Formal method plays an important role in modeling large scale concurrent networks through its efficient model construction and analysis. Taking urban road networks and public transportation systems as examples, such models can be defined in a formal ...
Jie Ding +3 more
doaj +1 more source
An Agglomeration Law for Sorting Networks and its Application in Functional Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In this paper we will present a general agglomeration law for sorting networks. Agglomeration is a common technique when designing parallel programmes to control the granularity of the computation thereby finding a better fit between the algorithm and ...
Lukas Immanuel Schiller
doaj +1 more source
Parallel String Sample Sort [PDF]
, 2013 We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we propose string ...
J. Kärkkäinen +9 more
core +3 more sources
An empirical study of the gap sequences for Shell sort
Lietuvos Matematikos Rinkinys, 2013 We present an improved version of the Shell sort algorithm. Using the algorithm, we study various geometrical sequences and the performance of Shell sort.
Irmantas Radavičius +1 more
doaj +1 more source
Path planning of coal gangue sorting robot based on G-RRT* algorithm
Gong-kuang zidonghua, 2022 The coal gangue sorting environment is complex. In order to avoid the collision between robot and obstacles and improve sorting efficiency, it is necessary to carry out path planning for robot. The principle of coal gangue sorting system is analyzed. The
ZHU Ziqi, LI Chuangye, DAI Wei
doaj +1 more source
Exploiting non-constant safe memory in resilient algorithms and data structures [PDF]
, 2015 We extend the Faulty RAM model by Finocchi and Italiano (2008) by adding a safe memory of arbitrary size $S$, and we then derive tradeoffs between the performance of resilient algorithmic techniques and the size of the safe memory.
DE STEFANI, LORENZO +1 more
core +2 more sources
An empirical study on SAJQ (Sorting Algorithm for Join Queries)
Egyptian Informatics Journal, 2010 Most queries that applied on database management systems (DBMS) depend heavily on the performance of the used sorting algorithm. In addition to have an efficient sorting algorithm, as a primary feature, stability of such algorithms is a major feature ...
Hassan I. Mathkour
doaj +1 more source
Average-case analysis of perfect sorting by reversals (Journal Version) [PDF]
, 2011 Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any common interval.
Bouvel, Mathilde +3 more
core +3 more sources