Results 11 to 20 of about 1,009,089 (269)
Acknowledgment to Reviewers of Algorithms in 2020
Algorithms, 2021 Peer review is the driving force of journal development, and reviewers are gatekeepers who ensure that Algorithms maintains its standards for the high quality of its published papers [...]
Algorithms Editorial Office
doaj +1 more source
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
Acknowledgment to Reviewers of Algorithms in 2021
Algorithms, 2022 Rigorous peer-reviews are the basis of high-quality academic publishing [...]
Algorithms Editorial Office
doaj +1 more source
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
Acknowledgement to Reviewers of Algorithms in 2019
Algorithms, 2020 The editorial team greatly appreciates the reviewers who have dedicated their considerable time and expertise to the journal’s rigorous editorial process over the past 12 months, regardless of whether the papers are finally published or no [...]
Algorithms Editorial Office
doaj +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
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.
Alexandre D. Jesus +3 more
openaire +2 more sources
On BMRN*-colouring of planar digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In a recent work, Bensmail, Blanc, Cohen, Havet and Rocha, motivated by applications for TDMA scheduling problems, have introduced the notion of BMRN*-colouring of digraphs, which is a type of arc-colouring with particular colouring constraints.
Julien Bensmail, Foivos Fioravantes
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
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