Results 251 to 260 of about 31,167 (325)
Efficient and reliable spike sorting from neural recordings with UMAP-based unsupervised nonlinear dimensionality reduction. [PDF]
PLoS BiolSuárez-Barrera D +11 more
europepmc +1 more source
PROTAC-DB 3.0: an updated database of PROTACs with extended pharmacokinetic parameters. [PDF]
Nucleic Acids ResGe J +9 more
europepmc +1 more source
Cooperative modular multilevel converter control based on PSO-optimized fuzzy-PI and hierarchical finite-state model predictive control. [PDF]
Sci RepLiu Y, Tian Y, Zhang W, Wang Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Data Structure and Algorithms Using C++, 2019
Searching data and sorting through data are fundamental algorithms. Searching refers to iterating over the data structure’s elements to retrieve some data. Sorting refers to putting the data structure’s elements in order. The searching and sorting algorithms are different for every data structure.
Sammie Bae
exaly +3 more sources
Searching data and sorting through data are fundamental algorithms. Searching refers to iterating over the data structure’s elements to retrieve some data. Sorting refers to putting the data structure’s elements in order. The searching and sorting algorithms are different for every data structure.
Sammie Bae
exaly +3 more sources
Introduction to Computational Thinking, 2021
In this chapter, we will explore two fundamental problems that are the foundations of many other algorithms: sorting sequences and searching for an element in them. These are central problems used as building blocks for a variety of other algorithms, and Python already has built-in functionality for solving them.
T. Mailund
semanticscholar +3 more sources
In this chapter, we will explore two fundamental problems that are the foundations of many other algorithms: sorting sequences and searching for an element in them. These are central problems used as building blocks for a variety of other algorithms, and Python already has built-in functionality for solving them.
T. Mailund
semanticscholar +3 more sources
Computer Programming in C for Beginners, 2020
As its title suggests, this chapter also has two parts. The first provides the reader with an introduction to searching – a very important aspect of computing. It introduces the sequential search and describes how to do it in an array as well as in a linked list.
Avelino J. Gonzalez
openaire +2 more sources
As its title suggests, this chapter also has two parts. The first provides the reader with an introduction to searching – a very important aspect of computing. It introduces the sequential search and describes how to do it in an array as well as in a linked list.
Avelino J. Gonzalez
openaire +2 more sources
Sorting, Approximate Sorting, and Searching in Rounds
SIAM Journal on Discrete Mathematics, 1988The worst case number of comparisons needed for sorting or selecting in rounds is considered. The following results are obtained. (a) For every fixed \(k\geq 2\), \(\Omega (n^{1+1/k}(\log n)^{1/k})\) comparisons are required to sort n elements in k rounds. \((O(n^{1+1/k}\log n)\) are known to be sufficient.) This improves the previously known bounds by
Noga Alon, Yossi Azar
exaly +3 more sources
Historical searching and sorting
International Symposium on Algorithms, 1991A ‘move to the front’ dictionary data structure that supports O(log t) time access to objects last accessed t operations ago is described. This ‘Historical Search Tree’ is then used in two adaptive sorting algorithms. The first algorithm, ‘Historical Insertion Sort’, exploits the temporal locality present in a nearly sorted list rather than the more ...
Alistair Moffat, Ola Petersson
openaire +2 more sources