Results 11 to 20 of about 9,995,501 (376)
Algorithmicity of Evolutionary Algorithms [PDF]
Studies in Logic, Grammar and Rhetoric, 2020 Abstract In the first part of our article we will refer the penetration of scientific terms into colloquial language, focusing on the sense in which the concept of an algorithm currently functions outside its original scope. The given examples will refer mostly to disciplines not directly related to computer science and to the colloquial
Sławomir Leciejewski +1 more
openaire +2 more sources
Algorithm selection of anytime algorithms [PDF]
Proceedings of the 2020 Genetic and Evolutionary Computation Conference, 2020 Anytime algorithms for optimization problems are of particular interest since they allow to trade off execution time with result quality. However, the selection of the best anytime algorithm for a given problem instance has been focused on a particular budget for execution time or particular target result quality.
Borges de Jesus, Alexandre +3 more
openaire +3 more sources
Algorithmic audits of algorithms, and the law
AI and Ethics, 2022 Algorithmic decision making is now widespread, ranging from health care allocation to more common actions such as recommendation or information ranking. The aim to audit these algorithms has grown alongside. In this paper, we focus on external audits that are conducted by interacting with the user side of the target algorithm, hence considered as a ...
Erwan Le Merrer +2 more
openaire +4 more sources
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
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
, 2021 Algorithmics is the study and practice of taking a high-level description of a program’s purpose and, from it, producing an executable program of acceptable efficiency. Each step in that process is justified by rigorous, careful reasoning at the moment it is taken; and the repertoire of steps allowed by that rigour, at each stage, guides the ...
Bird, Richard +10 more
openaire +2 more sources
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
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
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