Results 11 to 20 of about 7,082,722 (377)
Acknowledgment to the Reviewers of Algorithms in 2022
Algorithms, 2023 High-quality academic publishing is built on rigorous peer review [...]
Algorithms Editorial Office
doaj +1 more source
Critical Analysis: Bat Algorithm based Investigation and Application on Several Domains [PDF]
World Journal of Engineering, 2021, 2021 In recent years several swarm optimization algorithms, such as Bat Algorithm (BA) have emerged, which was proposed by Xin-She Yang in 2010. The idea of the algorithm was taken from the echolocation ability of bats. Purpose: The purpose of this study is to provide the reader with a full study of the Bat Algorithm, including its limitations, the fields
arxiv +1 more source
Some exactly solvable models of urn process theory [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We establish a fundamental isomorphism between discrete-time balanced urn processes and certain ordinary differential systems, which are nonlinear, autonomous, and of a simple monomial form.
Philippe Flajolet +2 more
doaj +1 more source
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 This extended abstract describes and analyses a near-optimal probabilistic algorithm, HYPERLOGLOG, dedicated to estimating the number of \emphdistinct elements (the cardinality) of very large data ensembles.
Philippe Flajolet +3 more
doaj +1 more source
Influence of the tie-break rule on the end-vertex problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976.
Pierre Charbit +2 more
doaj +1 more source
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer [PDF]
SIAM Review, 1995 A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true
P. Shor
semanticscholar +1 more source
The height of random binary unlabelled trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local
Nicolas Broutin, Philippe Flajolet
doaj +1 more source
BMC Bioinformatics, 2022 Distinct gene expression patterns within cells are foundational for the diversity of functions and unique characteristics observed in specific contexts, such as human tissues and cell types. Though some biological processes commonly occur across contexts,
Rebeca Queiroz Figueiredo +6 more
doaj +1 more source
SciPy 1.0: fundamental algorithms for scientific computing in Python
Nature Methods, 2019 SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors ...
Pauli Virtanen +111 more
semanticscholar +1 more source
Algorithms and Regulation [PDF]
, 2021 New technologies have always challenged the social, economic, legal, and ideological status quo. Constitutional law is no less impacted by such technologically driven transformations, as the state must formulate a legal response to new technologies and their market applications, as well as the state’s own use of new technology.
Reichman, Amnon, Sartor, Giovanni
openaire +2 more sources