Results 21 to 30 of about 4,116,478 (294)
Parameterized Distributed Algorithms [PDF]
, 2018 In this work, we initiate a thorough study of graph optimization problems parameterized by the output size in the distributed setting. In such a problem, an algorithm decides whether a solution of size bounded by k exists and if so, it finds one.
Ben-Basat, Ran +2 more
core +2 more sources
On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$.
Nicolas Bédaride +3 more
doaj +1 more source
Nondeterministic Algorithms [PDF]
Journal of the ACM, 1967 Programs to solve combinatorial search problems may often be simply written by using multiple-valued functions. Such programs, although impossible to execute directly on conventional computers, may be converted in a mechanical way into conventional backtracking programs.
openaire +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
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
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
Round Compression for Parallel Matching Algorithms [PDF]
, 2018 For over a decade now we have been witnessing the success of {\em massive parallel computation} (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark.
Czumaj, Artur +5 more
core +3 more sources
Approximation algorithms [PDF]
Proceedings of the National Academy of Sciences, 1997 Increasing global competition, rapidly changing markets, and greater consumer awareness have altered the way in which corporations do business. To become more efficient, many industries have sought to model some operational aspects by gigantic optimization problems. It is not atypical to encounter models that capture 10 6
Schulz, Andreas S. +2 more
openaire +2 more sources
Adaptive Alternating Minimization Algorithms [PDF]
, 2008 The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm has led to its application to many areas such as
Niesen, Urs +2 more
core +3 more sources