Results 1 to 10 of about 9,995,501 (376)

GROMACS 4:  Algorithms for Highly Efficient, Load-Balanced, and Scalable Molecular Simulation

open access: yesJournal of Chemical Theory and Computation, 2008
Berk Hess   +2 more
exaly   +2 more sources

Approximation Algorithms

open access: yesInternational Symposium on Parallel Architectures, Algorithms and Networks, 2021
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

Acknowledgment to Reviewers of Algorithms in 2020

open access: yesAlgorithms, 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

Acknowledgment to Reviewers of Algorithms in 2021

open access: yesAlgorithms, 2022
Rigorous peer-reviews are the basis of high-quality academic publishing [...]
Algorithms Editorial Office
doaj   +1 more source

An overview of gradient descent optimization algorithms [PDF]

open access: yesVestnik komp iuternykh i informatsionnykh tekhnologii, 2016
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

Acknowledgment to the Reviewers of Algorithms in 2022

open access: yesAlgorithms, 2023
High-quality academic publishing is built on rigorous peer review [...]
Algorithms Editorial Office
doaj   +1 more source

On BMRN*-colouring of planar digraphs [PDF]

open access: yesDiscrete 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

Acknowledgement to Reviewers of Algorithms in 2019

open access: yesAlgorithms, 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

Model of Multi-branch Trees for Efficient Resource Allocation [PDF]

open access: yes, 2020
Although exploring the principles of resource allocation is still important in many fields, little is known about appropriate methods for optimal resource allocation thus far.
Okada, Isamu   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy