Results 41 to 50 of about 57,373 (301)

Multi-objective routing optimization using evolutionary algorithms [PDF]

, 2012
Wireless ad hoc networks suffer from several limitations, such as routing failures, potentially excessive bandwidth requirements, computational constraints and limited storage capability. Their routing strategy plays a significant role in determining the
Cheung, Kent Tsz Kan, Halil Yetgin, Yetgin, Halil, Hanzo, Lajos, Kent Tsz Kan Cheung, Lajos Hanzo   +5 more
core   +1 more source

The Search-o-Sort Theory

AppliedMath
In the modern era of informatics, where data are very important, efficient management of data is necessary and critical. Two of the most important data management techniques are searching and data ordering (technically sorting).
Anurag Dutta, Sanjeev Kumar, Deepkiran Munjal, Pijush Kanti Kumar   +3 more
doaj   +1 more source

Spike Sorting Algorithms for Large-Scale Neural Recording [PDF]

Jisuanji gongcheng
Spike sorting refers to the detection, clustering, and identification of distinct extracellular neuronal signals from different recording sites with the aim of reliably assigning them to different putative neurons.
XU Mingliang, LI Fangyuan, MA Haoran, HE Fei
doaj   +1 more source

Algorithms for the Generalized Sorting Problem

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
We study the generalized sorting problem where we are given a set of n elements to be sorted but only a subset of all possible pair wise element comparisons is allowed. The goal is to determine the sorted order using the smallest possible number of allowed comparisons. The generalized sorting problem may be equivalently viewed as follows.
Zhiyi Huang 0002, Sampath Kannan, Sanjeev Khanna   +2 more
openaire   +3 more sources

Interpreting the effects of DNA polymerase variants at the structural level

Molecular Oncology, EarlyView.
Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi, Karolina Krzesińska, Ludovica Beltrame, Pablo Sánchez‐Izquierdo Besora, Matteo Tiberti, Mef Nilbert, Anna Rohlin, Elena Papaleo   +7 more
wiley   +1 more source

Comparative Analysis of Sorting Algorithms: TimSort Python and Classical Sorting Methods

JISA (Jurnal Informatika dan Sains)
The sorted() function within the Python programming language has emerged as the primary choice among developers for sorting operations. Consequently, this study offers a comparative analysis of various classical sorting algorithms and Python's built-in ...
Firmansyah Rekso Wibowo, Muhammad Faisal
doaj   +1 more source

Efficient Algorithms for Sorting in Trees

CoRR, 2022
Sorting is a foundational problem in computer science that is typically employed on sequences or total orders. More recently, a more general form of sorting on partially ordered sets (or posets), where some pairs of elements are incomparable, has been studied.
Jishnu Roychoudhury, Jatin Yadav
openaire   +2 more sources

Epigenetic heterogeneity and plasticity in therapy‐induced tumor states through single‐cell multi‐omics

Molecular Oncology, EarlyView.
Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim, Hwiyeong Lee, Jin Hong, Daechan Park   +3 more
wiley   +1 more source

When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting [PDF]

, 2022
Cache-adaptive algorithms are a class of algorithms that achieve optimal utilization of dynamically changing memory. These memory fluctuations are the norm in today’s multi-threaded shared-memory machines and time-sharing caches. Bender et al.
Nithyanand, Rishab, Chowdhury, Abiyaz, Xu, Helen, Bhattacharya, Arghya, Johnson, Rob, Das, Rathish, Bender, Michael A., Chowdhury, Rezaul A.   +7 more
core   +1 more source

The role of the use of visualization tools for teaching sorting algorithms in online teaching

Politehnika, 2021
Learning and teaching of sorting algorithms are very challenging for students and teachers as well. The issues are more highlighted in the online form of teaching which was the only form of schooling from March to June of the school year 2019/2020 in ...
Monika Mladenović, Lucija Udiljak, Ivica Boljat   +2 more
doaj