Results 31 to 40 of about 1,087,668 (215)
Parallel Balanced Allocations [PDF]
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019 We study parallel algorithms for the classical balls-into-bins problem, in which $m$ balls acting in parallel as separate agents are placed into $n$ bins. Algorithms operate in synchronous rounds, in each of which balls and bins exchange messages once.
Lenzen, C., Parter, M., Yogev, E.
openaire +5 more sources
Operational risk allocation in urban rail transit public–private partnership projects
Frontiers in Environmental Science, 2022 Operation risk (OR) has affected sustainable development of urban rail transit (URT) public–private partnership (PPP) projects in China. Balanced distribution of operational risks among stakeholders (the public, government, and private companies ...
Pengcheng Xiang +5 more
doaj +1 more source
FORESAM—FOG Paradigm-Based Resource Allocation Mechanism for Vehicular Clouds
Sensors, 2021 The Intelligent Transport Systems (ITS) has the objective quality of transportation improvement through transportation system monitoring and management and makes the trip more comfortable and safer for drivers and passengers. The mobile clouds can assist
Rickson Pereira +6 more
doaj +1 more source
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
openaire +4 more sources
South African Journal of Economic and Management Sciences, 2015 Regulation 28 of the Pension Funds Act now permits an increased allocation of 25 per cent to foreign investments. The regulation previously only permitted a 20 per cent allocation.
David John Bradfield, Brian Munro
doaj +1 more source
Derandomized Balanced Allocation [PDF]
, 2019 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, which provides $d$ independent bins for each ball and places the ball into the bin with the least load, and its non-uniform variant --- the \emph{Always-Go-Left}
openaire +4 more sources
Mean-Biased Processes for Balanced Allocations
CoRR, 2023 This paper refines and extends the content on non-filling processes in arXiv:2110.10759.
Dimitrios Los +2 more
openaire +2 more sources
The structure of balanced rings [PDF]
, 1973 Dlab V, Ringel CM. The structure of balanced rings. Proceedings of the London Mathematical Society.
Dlab, Vlastimil, Ringel, Claus Michael
core +1 more source
Cost allocation rule of minimum spanning tree problems without a supplier
Systems Science & Control Engineering, 2020 In this paper, the cost allocation problem of minimum spanning tree without a supplier has been discussed. By assigning nodes to play the role of supplier in turn, we can get n classic m.c.s.t.s.
Jia-quan Zhan, Hao Cheng, Zhen-sen Zhang
doaj +1 more source
Balanced Contributions for Multi-Issue Allocation Situations [PDF]
, 2005 In this paper we introduce a property of balanced contributions in the context of multi-issue allocation situations.Using this property, we characterise the run-to-thebank rule for multi-issue allocation ...
Lorenzo-Freire, S. +8 more
core +2 more sources