Results 31 to 40 of about 9,995,501 (376)
Constrained ear decompositions in graphs and digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj +1 more source
, 2013 One of the central questions in free speech jurisprudence is what activities the First Amendment encompasses. This Article considers that question in the context of an area of increasing importance – algorithm-based decisions.
Bolin, Malin, Nordin, Maria
core +2 more sources
Acknowledgement to Reviewers of Algorithms in 2016
Algorithms, 2017 The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2016.[...]
Algorithms Editorial Office
doaj +1 more source
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
Algorithms for geodesics [PDF]
, 2012 Algorithms for the computation of geodesics on an ellipsoid of revolution are given. These provide accurate, robust, and fast solutions to the direct and inverse geodesic problems and they allow differential and integral properties of geodesics to be ...
BR Bowring +6 more
core +2 more sources
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
Quantum Algorithms Revisited [PDF]
, 1997 Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations.
Cleve, Richard +3 more
core +5 more sources
Journal of Differential Equations, 1993 Consider the differential inclusion \((*)\) \(x'(t)\in F(t,x(t))\), where \(F\) is a given multifunction with values in finite dimensional space. A set \(K\) is called a viability set for \((*)\) if for every \(x_ 0\in K\) there exists a solution of \((*)\) starting from \(x_ 0\) which remains in \(K\).
COLOMBO, GIOVANNI, V. Krivan
openaire +2 more sources
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