Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Sirotkin, Dmitry"'
This paper examines the graph partition problem and introduces a new metric, MSIDS (maximal sum of inner degrees squared). We establish its connection to the replication factor (RF) optimization, which has been the main focus of theoretical work in t
Externí odkaz:
http://arxiv.org/abs/2404.07624
We present a novel graph partition algorithm with a theoretical bound for the replication factor of \sqrt(n), which improves known constrained approaches (grid: 2* \sqrt(n)-1, torus: 1.5*\sqrt(n)+1) and provides better performance
Comment: 12 pa
Comment: 12 pa
Externí odkaz:
http://arxiv.org/abs/2312.13861
In this paper, we demonstrate how the problem of the optimal team choice in the popular computer game Dota Underlords can be reduced to the problem of linear integer programming. We propose a model and solve it for the real data. We also prove that t
Externí odkaz:
http://arxiv.org/abs/2007.05020
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.
Publikováno v:
Research in Computational Molecular Biology (9783319319568); 2016, p3-16, 14p
Autor:
Mona Singh
This book constitutes the proceedings of the 20th Annual Conference on Research in Computational Molecular Biology, RECOMB 2016, held in Santa Monica, CA, USA, in April 2016. The 15 regular papers presented in this volume were carefully reviewed and