Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Alexey Gronskiy"'
Publikováno v:
Theoretical Computer Science, 745
Theoretical Computer Science, 745
ISSN:0304-3975
ISSN:0304-3975
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::857ed0d9faac10c3178f1e8d0361df15
https://doi.org/10.1016/j.tcs.2018.04.015
https://doi.org/10.1016/j.tcs.2018.04.015
Publikováno v:
ISIT
Information theoretic properties of large combinatorial systems enable us in better understanding their solution structure and provide insights how to optimize them in a robust manner. In this paper, we revisit the idea of characterizing structural i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6dce9e79313b14bc180aceb271983a5b
https://doi.org/10.1109/isit.2018.8437718
https://doi.org/10.1109/isit.2018.8437718
Autor:
Matúš Mihalák, Rastislav Šrámek, Peter Widmayer, Tobias Pröger, Joachim M. Buhmann, Alexey Gronskiy
Publikováno v:
Journal of Computer and System Sciences, 94
Journal of Computer and System Sciences, 94, 135-166. Academic Press Inc.
Journal of Computer and System Sciences, 94, 135-166. Academic Press Inc.
We propose a novel approach for optimization under uncertainty. Our approach does not assume any particular noise model behind the measurements, and only requires two typical instances. We first propose a measure of similarity of instances (with resp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::689bb050b4e33fb4d8f523f2fdf588c3
Publikováno v:
2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
ANALCO
ANALCO
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67a4c5e7416f3088b98f6f696d545a4d
https://hdl.handle.net/20.500.11850/225633
https://hdl.handle.net/20.500.11850/225633
Publikováno v:
ITA
NP-hard combinatorial optimization algorithms are often characterized by their approximation ratios. In real world applications, the resilience of algorithms to input fluctuations and to modelling errors pose important robustness requirements. This w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b5bf3a5a0c9a4ddbba0fceaf078a0b8
https://doi.org/10.1109/ita.2016.7888176
https://doi.org/10.1109/ita.2016.7888176
Publikováno v:
Proceedings of the IEEE Information Theory Workshop (ITW 2015)
MAXCUT defines a classical NP-hard problem for graph partitioning and it serves as a typical case of the symmetric non-monotone Unconstrained Submodular Maximization (USM) problem. Applications of MAXCUT are abundant in machine learning, computer vis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af8a5cc7409485fdf25fc272dac9ee4b
https://doi.org/10.1109/itw.2015.7133122
https://doi.org/10.1109/itw.2015.7133122
Autor:
Joachim M. Buhmann, Alexey Gronskiy
Publikováno v:
ISIT
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b312243b4b939e397a318ed3842ede03
https://doi.org/10.1109/isit.2014.6875239
https://doi.org/10.1109/isit.2014.6875239