Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Alberi, Stephora"'
Sequential algorithms for the Stable Matching Problem are often too slow in the context of some large scale applications like switch scheduling. Parallel architectures can offer a notable decrease in runtime complexity. We propose a stable matching a
Externí odkaz:
http://arxiv.org/abs/2401.07467