Results 81 to 90 of about 57,373 (301)
Matrix Sort - A Parallelizable Sorting Algorithm
International Journal of Computer Applications, 2016 Sorting algorithms are the class of algorithms that result in the ordered arrangement of a list of given elements. The arrangement can be in ascending or descending order based on the requirement given. Time complexity, space complexity and optimality are used to assess the algorithms.
Saketh A., Vijay V., S. Kavitha
openaire +1 more source
Added Prognostic Value of EEG Reactivity in Comatose Patients Following Cardiac Arrest
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objectives To evaluate the added prognostic value of EEG reactivity for favorable outcome compared with background analysis during and after targeted temperature management (TTM). Methods Prospective observational cohort study of comatose post–cardiac arrest patients admitted to a single academic center between 2017 and 2022, all undergoing ...
Sarah Caroyer +11 more
wiley +1 more source
On Batcher's merge sorts as parallel sorting algorithms
, 1998 We examine the average running times of Batcher's bitonic merge and Batcher's odd-even merge when they are used as parallel merging algorithms. It has been shown previously that the running time of odd-even merge can be upper bounded by a function of the maximal rank difference for elements in the two input sequences.
openaire +3 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective We aim to comprehensively analyze how regional tumor and edema characteristics are associated with clinical presentations and survival outcomes in a large cohort of glioblastoma patients. Methods Patients with IDH‐wildtype glioblastoma who received brain MRI from 2010 to 2023 were included.
Daniel J. Zhou +16 more
wiley +1 more source
SORTING ALGORITHMS REALIZATION AND THEIR FEATURES [PDF]
, 2020 The performance of computers and programs is the most important thing for a user nowadays. Sorting algorithms appeared in the 19th century, but nowadays, developers often forget about the effectiveness of these algorithms and always use only a couple of ...
Cabuļevs, Ivars, Zorins, Aleksejs
core +2 more sources
Peripheral Neutrophil Activation and Extracellular Trap Formation in Amyotrophic Lateral Sclerosis
Annals of Clinical and Translational Neurology, EarlyView.Markers of neutrophil activation are increased in plasma during ALS, and markers of NET formation associate with ALS survival. ABSTRACT Objectives Peripheral neutrophil levels in amyotrophic lateral sclerosis (ALS) inversely correlate with survival, suggesting a role for neutrophils in disease progression.
Lillia A. Baird +9 more
wiley +1 more source
The asymptotic behaviour of a distributive sorting method [PDF]
In the distributive sorting method of Dobosiewicz, both the interval between the minimum and the median of the numbers to be sorted and the interval between the median and the maximum are partitioned inton/2 subintervals of equal length; the procedure is
Dam, W.B. van +2 more
core +1 more source
Sorting algorithms and their utilization [PDF]
, 2008 Tato diplomová práce se zabývá řadícími algoritmy, jejich popisem, porovnáním a implementací. V první části práce popisuji široké téma třídění a řadících algoritmů. Charakterizuji jejich principy, vlastnosti a provádím jejich analýzu.
Mlček, Pavel
core
Recombination and Self-Adaptation in Multi-objective Genetic Algorithms [PDF]
, 2004 This paper investigates the influence of recombination and self-adaptation in real-encoded Multi-Objective Genetic Algorithms (MOGAs). NSGA-II and SPEA2 are used as example to characterize the efficiency of MOGAs in relation to various recombination ...
Régnier, Jérémi +5 more
core +1 more source
Analysis of Algorithms: An Example of a Sort Algorithm
Formalized Mathematics, 2013 Summary We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exchanging in terms of program algebra over an algebra.
openaire +2 more sources