Results 11 to 20 of about 9,890,926 (378)
Algorithm selection of anytime algorithms [PDF]
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
1 Summary of Approximation Algorithms from Lecture 1.1 k-Approximations Approximation algorithms help us get around the lack of efficient algorithms for NP-hard problems by taking advantage of the fact that, for many practical applications, an answer ...
Mohit Singh, Kunal Talwar
semanticscholar +1 more source
Algorithmicity of Evolutionary Algorithms [PDF]
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
Algorithmic audits of algorithms, and the law
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
An overview of gradient descent optimization algorithms [PDF]
The statistical testing technique is considered to compare the metrics values of machine learning models on a test set. Since the values of metrics depend not only on the models, but also on the data, it may turn out that different models are the best on
Sebastian Ruder
semanticscholar +1 more source
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
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer [PDF]
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
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
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
Acknowledgement to Reviewers of Algorithms in 2014
The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2014:[...]
Algorithms Editorial Office
doaj +1 more source