Results 1 to 10 of about 1,323,841 (206)
Balanced allocation on hypergraphs [PDF]
Journal of Computer and System Sciences, 2020 We consider a variation of balls-into-bins which randomly allocates $m$ balls into $n$ bins. Following Godfrey's model (SODA, 2008), we assume that each ball $t$, $1\le t\le m$, comes with a hypergraph $\mathcal{H}^{(t)}=\{B_1,B_2,\ldots,B_{s_t}\}$, and ...
Catherine S. Greenhill +2 more
semanticscholar +4 more sources
Sustainability, 2022 The balanced allocation of medical and health resources is an important basis for the sustainable development of health undertakings. In recent years, China has made remarkable achievements in the medical and health services, but there is still a ...
Fang-hong Wu +4 more
exaly +2 more sources
The power of thinning in balanced allocation [PDF]
Electronic Communications in Probability, 2018 Balls are sequentially allocated into $n$ bins as follows: for each ball, an independent, uniformly random bin is generated. An overseer may then choose to either allocate the ball to this bin, or else the ball is allocated to a new independent uniformly
O. Feldheim, O. Gurel-Gurevich
semanticscholar +4 more sources
Derandomized Balanced Allocation [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2017 In this paper, we study the maximum loads of explicit hash families in the $d$-choice schemes when allocating sequentially $n$ balls into $n$ bins. We consider the \emph{Uniform-Greedy} scheme \cite{ABKU}, which provides $d$ independent bins for each ...
Xue Chen
semanticscholar +4 more sources
Balanced allocation through random walk [PDF]
Information Processing Letters, 2017 We consider the allocation problem in which $m \leq (1-\epsilon) dn $ items are to be allocated to $n$ bins with capacity $d$. The items $x_1,x_2,\ldots,x_m$ arrive sequentially and when item $x_i$ arrives it is given two possible bin locations $p_i=h_1 ...
A. Frieze, Samantha Petti
semanticscholar +5 more sources
Balanced Allocation on Dynamic Hypergraphs
CoRR, 2020 The {balls-into-bins model} randomly allocates n sequential balls into n bins, as follows: each ball selects a set D of d ⩾ 2 bins, independently and uniformly at random, then the ball is allocated to a least-loaded bin from D (ties broken randomly). The maximum load is the maximum number of balls in any bin. In 1999, Azar et al.
Catherine S. Greenhill +2 more
semanticscholar +5 more sources
Balanced Cloud Edge Resource Allocation Based on Conflict Conditions
IEEE Access, 2020 Under a multiscenario environment with frequent bursts of data in the edge cloud, the resource allocation in the edge cloud will affect the stability of its nodes.
Leilei Zhu, Jiahui Feng, Hongwei Yang
exaly +3 more sources
A Balanced Algorithm for In-City Parking Allocation: A Case Study of Al Madinah City
Sensors, 2021 Parking in heavily populated areas has been considered one of the main challenges in the transportation systems for the past two decades given the limited parking resources, especially in city centres. Drivers often waste long periods of time hunting for
Mohammad A. R. Abdeen +2 more
doaj +2 more sources
Balanced allocation on graphs: A random walk approach [PDF]
Random Structures & Algorithms, 2014 We propose algorithms for allocating n sequential balls into n bins that are interconnected as a d‐regular n‐vertex graph G, where d ≥ 3 can be any integer. In general, the algorithms proceeds in n succeeding rounds.
Ali Pourmiri
semanticscholar +6 more sources
Long-term balanced allocation via thinning [PDF]
The Annals of Applied Probability, 2021 We study the long-term behavior of the two-thinning variant of the classical balls-and-bins model. In this model, an overseer is provided with uniform random allocation of $m$ balls into $n$ bins in an on-line fashion.
O. Feldheim +2 more
semanticscholar +1 more source