Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Florescu, Cella"'
In this paper, we investigate the question of whether the electrical flow routing is a good oblivious routing scheme on an $m$-edge graph $G = (V, E)$ that is a $\Phi$-expander, i.e. where $\lvert \partial S \rvert \geq \Phi \cdot \mathrm{vol}(S)$ fo
Externí odkaz:
http://arxiv.org/abs/2406.07252
The compact Genetic Algorithm (cGA), parameterized by its hypothetical population size $K$, offers a low-memory alternative to evolving a large offspring population of solutions. It evolves a probability distribution, biasing it towards promising sam
Externí odkaz:
http://arxiv.org/abs/2404.12147