Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Moritz Mühlenthaler"'
Publikováno v:
Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977585
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a62b750b61010aa990483b951833ad4d
https://doi.org/10.1137/1.9781611977585.ch12
https://doi.org/10.1137/1.9781611977585.ch12
Meta-heuristics are powerful tools for solving optimization problems whose structural properties are unknown or cannot be exploited algorithmically. We propose such a meta-heuristic for a large class of optimization problems over discrete domains bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::23384d6ab29e0a48928e277b27d09910
https://opus4.kobv.de/opus4-fau/frontdoor/index/index/docId/22243
https://opus4.kobv.de/opus4-fau/frontdoor/index/index/docId/22243
Autor:
Takehiro Ito, Yusuke Kobayashi, Marthe Bonamy, Marc Heinrich, Akira Suzuki, Haruka Mizuta, Moritz Mühlenthaler, Kunihiro Wasa
Publikováno v:
Theoretical Computer Science. 838:45-57
Given a k-coloring of a graph G, a Kempe-change for two colors a and b produces another k-coloring of G, as follows: first choose a connected component in the subgraph of G induced by the two color classes of a and b, and then swap the colors a and b
Autor:
Moritz Mühlenthaler, Alexander Raß
Publikováno v:
it - Information Technology. 61:177-185
A discrete particle swarm optimization (PSO) algorithm is a randomized search heuristic for discrete optimization problems. A fundamental question about randomized search heuristics is how long it takes, in expectation, until an optimal solution is f
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030457709
IPCO
IPCO
Graph connectivity and network design problems are among the most fundamental problems in combinatorial optimization. The minimum spanning tree problem, the two edge-connected spanning subgraph problem (\(2\) -ECSS) and the tree augmentation problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6d60024edcf3ceab3db210e42faff1a
https://doi.org/10.1007/978-3-030-45771-6_2
https://doi.org/10.1007/978-3-030-45771-6_2
Graph connectivity and network design problems are among the most fundamental problems in combinatorial optimization. The minimum spanning tree problem, the two edge-connected spanning subgraph problem (2-ECSS) and the tree augmentation problem (TAP)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb3179c8ebdb96c1d39e717d00528443
http://arxiv.org/abs/1910.13297
http://arxiv.org/abs/1910.13297
Publikováno v:
International Workshop on Graph-Theoretic Concepts in Computer Science (WG) 2019
WG 2019-45th International Workshop on Graph-Theoretic Concepts in Computer Science
WG 2019-45th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2019, Vall de Núria, Spain. pp.162-174, ⟨10.1007/978-3-030-30786-8_13⟩
Graph-Theoretic Concepts in Computer Science ISBN: 9783030307851
WG
WG 2019-45th International Workshop on Graph-Theoretic Concepts in Computer Science
WG 2019-45th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2019, Vall de Núria, Spain. pp.162-174, ⟨10.1007/978-3-030-30786-8_13⟩
Graph-Theoretic Concepts in Computer Science ISBN: 9783030307851
WG
Imagine that unlabelled tokens are placed on the edges of a graph, such that no two tokens are placed on incident edges. A token can jump to another edge if the edges having tokens remain independent. We study the problem of determining the distance
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c6e6e205262604c7e854d4e3b7ead11
https://hal.archives-ouvertes.fr/hal-02373504
https://hal.archives-ouvertes.fr/hal-02373504
Autor:
Akira Suzuki, Marthe Bonamy, Haruka Mizuta, Kunihiro Wasa, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Marc Heinrich
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030261757
COCOON
COCOON
Given a k-coloring of a graph G, a Kempe-change for two colors a and b produces another k-coloring of G, as follows: first choose a connected component in the subgraph of G induced by the two color classes of a and b, and then swap the colors a and b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::647559a473f50912f155f9e1594823c1
https://doi.org/10.1007/978-3-030-26176-4_5
https://doi.org/10.1007/978-3-030-26176-4_5
Publikováno v:
FOGA
We present the analysis of a discrete particle swarm optimization (PSO) algorithm that works on a significantly large class of discrete optimization problems. Assuming a black-box setting, we prove upper and lower bounds on the expected number of fun
Publikováno v:
ReConFig
Modern Programmable FPGA-based SoCs that tightly couple CPU and programmable logic enable the acceleration of stream processing in hardware on-demand by making use of the available high input and output throughputs and the reconfigurability both in s