Results 181 to 190 of about 1,087,668 (215)
Some of the next articles are maybe not open access.
Balanced allocations (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94, 1994Suppose that we sequentially place n balls into n boxes by putting each ball into a randomly chosen box. It is well known that when we are done, the fullest box has with high probability lnn/lnlnn(1 + o(1)) balls in it. Suppose instead, that for each ball we choose two boxes at random and place the ball into the one which is less full at the time of ...
Yossi Azar +3 more
openaire +2 more sources
An Improved Drift Theorem for Balanced Allocations
ACM Transactions on AlgorithmsIn the balanced allocations framework, there are \(m\) jobs (balls) to be allocated to \(n\) servers (bins). The goal is to minimize the gap , the difference between the maximum and the average load.
Thomas Sauerwald, Dimitrios Los
exaly +5 more sources
Derandomized Asymmetrical Balanced Allocation
2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2019Balls-in-bins model, in which n balls are sequentially placed into n bins according to some dispatching policy, is an important model with a wide range of applications despite its simplicity. The power-of-d choices (Pod) policy, in which each ball samples d independent uniform random bins and join the one with the least load (where ties are broken ...
Dengwang Tang, Vijay G. Subramanian
openaire +2 more sources
Towards Balanced Allocations for DHTs
2011We consider the problem of load-balancing structured peer-to-peer networks. Load-balancing is of major significance for large-scale decentralized networks in terms of enhanced scalability and performance. Our methods focus mainly on task-skew. Specifically, we address the problem with general rigorous algorithms on the basis of migration. In particular,
George Tsatsanifos, Vasilis Samoladas
openaire +1 more source
Quantum Sampling for Balanced Allocations
2003It is known that the original Grover Search (GS) can be modified to use a general value for the phase θ of the diffusion transform. Then, if the number of answers is relatively large, this modified GS can find one of the answers with probability one in a single iteration.
Kazuo Iwama +2 more
openaire +2 more sources
Balanced Allocation Methods for Claims Problems with Indivisibilities [PDF]
SSRN Electronic Journal, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carmen Herrero, Ricardo Martínez 0002
openaire +1 more source
Efficient allocation of balancing and ramping costs
2014 Power Systems Computation Conference, 2014Electricity market designs must evolve to incorporate efficiently the large-scale penetration of renewable energy sources and demand side participation. Current renewable energy support schemes and fixed tariff systems fail to address two major power system operation issues and therefore create additional system costs.
Tobias W. Haring +2 more
openaire +2 more sources
Balanced allocations for tree-like inputs
Information Processing Letters, 1995Abstract We consider the following procedure for constructing a directed tree on n vertices: The underlying undirected tree is fixed in advance but the edges of the tree are presented in a random order (all orders are equally likely); each edge is oriented towards its endpoint that has the lower indegree at the time of its insertion.
Andrei Z. Broder +4 more
openaire +2 more sources
Studying Balanced Allocations with Differential Equations
Combinatorics, Probability and Computing, 1999Using differential equations, we examine the GREEDY algorithm studied by Azar, Broder, Karlin and Upfal for distributed load balancing [1]. This approach yields accurate estimates of the actual load distribution, provides insight into the exponential improvement GREEDY offers over simple random selection, and allows one to prove tight concentration ...
openaire +3 more sources
Bank balance sheet risk allocation
Journal of Banking & Finance, 2019We formulate the optimal balance sheet management problem as a linear program and study it using a duality approach. In addition to helping to determine the optimal balance sheet, the dual problem also provides us the market prices of interest rate risk and credit risk.
Pedro Júdice, Qiji Jim Zhu
openaire +1 more source