Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Redlich, Amanda"'
Autor:
Kotturu, Monish Reddy, Movahed, Saniya Vahedian, Robinette, Paul, Jerath, Kshitij, Redlich, Amanda, Azadeh, Reza
We introduce an approach to improve team performance in a Multi-Agent Multi-Armed Bandit (MAMAB) framework using Fastest Mixing Markov Chain (FMMC) and Fastest Distributed Linear Averaging (FDLA) optimization algorithms. The multi-agent team is repre
Externí odkaz:
http://arxiv.org/abs/2410.23379
Autor:
Moses Jr., William K., Redlich, Amanda
In this paper, we look at and expand the problems of dispersion and Byzantine dispersion of mobile robots on a graph, introduced by Augustine and Moses~Jr.~[ICDCN~2018] and by Molla, Mondal, and Moses~Jr.~[ALGOSENSORS~2020], respectively, to graphs w
Externí odkaz:
http://arxiv.org/abs/2311.01511
Let $t(H;G)$ be the homomorphism density of a graph $H$ into a graph $G$. Sidorenko's conjecture states that for any bipartite graph $H$, $t(H;G)\geq t(K_2;G)^{|E(H)|}$ for all graphs $G$. It is already known that such inequalities cannot be certifie
Externí odkaz:
http://arxiv.org/abs/2206.10058
Publikováno v:
In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), 655-671
Load balancing is a well-studied problem, with balls-in-bins being the primary framework. The greedy algorithm $\mathsf{Greedy}[d]$ of Azar et al. places each ball by probing $d > 1$ random bins and placing the ball in the least loaded of them. With
Externí odkaz:
http://arxiv.org/abs/1602.08298
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 65).
Recently, there has been much research on processes that are mostly
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 65).
Recently, there has been much research on processes that are mostly
Externí odkaz:
http://hdl.handle.net/1721.1/60201
Answering a question of Kolaitis and Kopparty, we show that, for given integer $q>1$ and pairwise nonisomorphic connected graphs $G_1...G_k$, if $p=p(n) $ is such that $\Pr(G_{n,p}\supseteq G_i)\to 1$ $\forall i$, then, with $\xi_i$ the number of cop
Externí odkaz:
http://arxiv.org/abs/1402.2264
Autor:
Redlich, Amanda
We consider the unbalanced allocation of $m$ balls into $n$ bins by a randomized algorithm using the "power of two choices". For each ball, we select a set of bins at random, then place the ball in the fullest bin within the set. Applications of this
Externí odkaz:
http://arxiv.org/abs/1401.0223
Autor:
Beheshti, Shabnam, Redlich, Amanda
We survey several results connecting combinatorics and Wronskian solutions of the KP equation, contextualizing the successes of a recent approach introduced by Kodama, et. al. We include the necessary combinatorial and analytical background to presen
Externí odkaz:
http://arxiv.org/abs/1309.1480
Autor:
DeMarco, Bobby, Redlich, Amanda
Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a sufficient co
Externí odkaz:
http://arxiv.org/abs/1211.2243
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.