Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Hespe, Demian"'
In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or combining of partial solutions and filtering of dominated solutions i
Externí odkaz:
http://arxiv.org/abs/2409.10232
Autor:
Uhl, Tim Niklas, Schimek, Matthias, Hübner, Lukas, Hespe, Demian, Kurpicz, Florian, Stelz, Christoph, Sanders, Peter
The Message-Passing Interface (MPI) and C++ form the backbone of high-performance computing, but MPI only provides C and Fortran bindings. While this offers great language interoperability, high-level programming languages like C++ make software deve
Externí odkaz:
http://arxiv.org/abs/2404.05610
Publikováno v:
2022 IEEE/ACM 12th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS), Dallas, TX, USA, 2022, pp. 24-35
Fault-tolerant distributed applications require mechanisms to recover data lost via a process failure. On modern cluster systems it is typically impractical to request replacement resources after such a failure. Therefore, applications have to contin
Externí odkaz:
http://arxiv.org/abs/2203.01107
Finding a maximum independent set is a fundamental NP-hard problem that is used in many real-world applications. Given an unweighted graph, this problem asks for a maximum cardinality set of pairwise non-adjacent vertices. Some of the most successful
Externí odkaz:
http://arxiv.org/abs/2102.01540
We present the winning solver of the PACE 2019 Implementation Challenge, Vertex Cover Track. The minimum vertex cover problem is one of a handful of problems for which kernelization---the repeated reducing of the input size via data reduction rules--
Externí odkaz:
http://arxiv.org/abs/1908.06795
Autor:
Hespe, Demian, Sanders, Peter
A highly successful approach to route planning in networks (particularly road networks) is to identify a hierarchy in the network that allows faster queries after some preprocessing that basically inserts additional "shortcut"-edges into a graph. In
Externí odkaz:
http://arxiv.org/abs/1907.03535
Autor:
Ferizovic, Damir, Hespe, Demian, Lamm, Sebastian, Mnich, Matthias, Schulz, Christian, Strash, Darren
Kernelization is a general theoretical framework for preprocessing instances of NP-hard problems into (generally smaller) instances with bounded size, via the repeated application of data reduction rules. For the fundamental Max Cut problem, kerneliz
Externí odkaz:
http://arxiv.org/abs/1905.10902
Main memory column-stores have proven to be efficient for processing analytical queries. Still, there has been much less work in the context of clusters. Using only a single machine poses several restrictions: Processing power and data volume are bou
Externí odkaz:
http://arxiv.org/abs/1709.05183
The most efficient algorithms for finding maximum independent sets in both theory and practice use reduction rules to obtain a much smaller problem instance called a kernel. The kernel can then be solved quickly using exact or heuristic algorithms---
Externí odkaz:
http://arxiv.org/abs/1708.06151
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.