Results 31 to 40 of about 7,082,722 (377)
Development of an early alert model for pandemic situations in Germany
Scientific Reports, 2023 The COVID-19 pandemic has pointed out the need for new technical approaches to increase the preparedness of healthcare systems. One important measure is to develop innovative early warning systems.
Danqi Wang +9 more
doaj +1 more source
Arc-Search Infeasible Interior-Point Algorithm for Linear Programming [PDF]
Numerical Algorithms (2017) 74:(4) 967-996, 2014 Mehrotra's algorithm has been the most successful infeasible interior-point algorithm for linear programming since 1990. Most popular interior-point software packages for linear programming are based on Mehrotra's algorithm. This paper proposes an alternative algorithm, arc-search infeasible interior-point algorithm.
arxiv +1 more source
Acknowledgement to Reviewers of Algorithms in 2017
Algorithms, 2018 Peer review is an essential part in the publication process, ensuring that Algorithms maintains high quality standards for its published papers.[...]
Algorithms Editorial Office
doaj +1 more source
Sampling-based algorithms for optimal motion planning [PDF]
Int. J. Robotics Res., 2011 During the last decade, sampling-based path planning algorithms, such as probabilistic roadmaps (PRM) and rapidly exploring random trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness.
S. Karaman, Emilio Frazzoli
semanticscholar +1 more source
A Note on the Performance of Algorithms for Solving Linear Diophantine Equations in the Naturals [PDF]
arXiv, 2021 We implement four algorithms for solving linear Diophantine equations in the naturals: a lexicographic enumeration algorithm, a completion procedure, a graph-based algorithm, and the Slopes algorithm. As already known, the lexicographic enumeration algorithm and the completion procedure are slower than the other two algorithms.
arxiv
Fast parallel algorithms for short-range molecular dynamics
, 1993 Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region ...
S. Plimpton
semanticscholar +1 more source
Critic Algorithms using Cooperative Networks [PDF]
arXiv, 2022 An algorithm is proposed for policy evaluation in Markov Decision Processes which gives good empirical results with respect to convergence rates. The algorithm tracks the Projected Bellman Error and is implemented as a true gradient based algorithm. In this respect this algorithm differs from TD($\lambda$) class of algorithms. This algorithm tracks the
arxiv
GROMACS 4: Algorithms for Highly Efficient, Load-Balanced, and Scalable Molecular Simulation.
Journal of Chemical Theory and Computation, 2008 Molecular simulation is an extremely useful, but computationally very expensive tool for studies of chemical and biomolecular systems. Here, we present a new implementation of our molecular simulation toolkit GROMACS which now both achieves extremely ...
B. Hess +3 more
semanticscholar +1 more source
On Cheating Immune Secret Sharing [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 The paper addresses the cheating prevention in secret sharing. We consider secret sharing with binary shares. The secret also is binary. This model allows us to use results and constructions from the well developed theory of cryptographically strong ...
Josef Pieprzyk, Xian-Mo Zhang
doaj +1 more source
Characterisations of Ideal Threshold Schemes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 We characterise ideal threshold schemes from different approaches. Since the characteristic properties are independent to particular descriptions of threshold schemes all ideal threshold schemes can be examined by new points of view and new results on ...
Josef Pieprzyk, Xian-Mo Zhang
doaj +1 more source