Results 181 to 190 of about 1,329,202 (241)
Some of the next articles are maybe not open access.
SIAM Journal on Computing, 1999
Summary: Suppose 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 \((1 + o(1))\ln n/\ln \ln n\) balls in it. Suppose instead that for each ball we choose two boxes at random and place the ball into the one which is ...
Yossi Azar +3 more
openaire +1 more source
Summary: Suppose 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 \((1 + o(1))\ln n/\ln \ln n\) balls in it. Suppose instead that for each ball we choose two boxes at random and place the ball into the one which is ...
Yossi Azar +3 more
openaire +1 more source
Performance Enhancement of C-V2X Mode 4 with Balanced Resource Allocation
ICC 2022 - IEEE International Conference on Communications, 2022Cellular vehicles-to-everything (C-V2X) is an essential technology to enhance road safety, traffic management and smart mobility. C-V2X Mode 4 uses sensing based semi-persistent scheduling (SB-SPS) to mitigate packet collisions, that consists of several ...
Moin Ali, Hyundong Hwang, Young-Tak Kim
semanticscholar +1 more source
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006
We give a randomized algorithm for the well known caking cutting problem that achieves approximate fairness, and has complexity O(n), when all players are honest. The heart of this result involves extending the standard offline multiple-choice balls and bins analysis to the case where the underlying resources/bins/machines have different utilities to ...
Jeff Edmonds, Kirk Pruhs
openaire +1 more source
We give a randomized algorithm for the well known caking cutting problem that achieves approximate fairness, and has complexity O(n), when all players are honest. The heart of this result involves extending the standard offline multiple-choice balls and bins analysis to the case where the underlying resources/bins/machines have different utilities to ...
Jeff Edmonds, Kirk Pruhs
openaire +1 more source
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007
We investigate balls-and-bins processes where m weighted balls areplaced into n bins using the "power of two choices" paradigm,whereby a ball is inserted into the less loaded of two randomly chosen bins. The case where each of the m balls has unit weight had been studied extensively. In a seminal paper Azar et.al.
Kunal Talwar, Udi Wieder
openaire +1 more source
We investigate balls-and-bins processes where m weighted balls areplaced into n bins using the "power of two choices" paradigm,whereby a ball is inserted into the less loaded of two randomly chosen bins. The case where each of the m balls has unit weight had been studied extensively. In a seminal paper Azar et.al.
Kunal Talwar, Udi Wieder
openaire +1 more source
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000
We investigate balls-into-bins processes allocating m balls into n bins based on the multiple-choice paradigm. In the classical single-choice variant each ball is placed into a bin selected uniformly at random. In a multiple-choice process each ball can be placed into one out of $d \ge 2$ randomly selected bins.
Petra Berenbrink +3 more
openaire +1 more source
We investigate balls-into-bins processes allocating m balls into n bins based on the multiple-choice paradigm. In the classical single-choice variant each ball is placed into a bin selected uniformly at random. In a multiple-choice process each ball can be placed into one out of $d \ge 2$ randomly selected bins.
Petra Berenbrink +3 more
openaire +1 more source
IEEE Transactions on Mobile Computing
Federated Learning (FL) has significant potential to protect data privacy and mitigate network burden in mobile edge computing (MEC) networks. However, due to the system and data heterogeneity of mobile clients (MCs), client selection and bandwidth ...
Jian Tang +5 more
semanticscholar +1 more source
Federated Learning (FL) has significant potential to protect data privacy and mitigate network burden in mobile edge computing (MEC) networks. However, due to the system and data heterogeneity of mobile clients (MCs), client selection and bandwidth ...
Jian Tang +5 more
semanticscholar +1 more source
2003
We investigate randomized processes underlying load balancing based on the multiple-choice paradigm: m balls have to be placed in n bins, and each ball can be placed into one out of 2 randomly selected bins. The aim is to distribute the balls as evenly as possible among the bins.
Artur Czumaj +2 more
openaire +1 more source
We investigate randomized processes underlying load balancing based on the multiple-choice paradigm: m balls have to be placed in n bins, and each ball can be placed into one out of 2 randomly selected bins. The aim is to distribute the balls as evenly as possible among the bins.
Artur Czumaj +2 more
openaire +1 more source
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 +1 more source
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2019
This paper studies two distributed resource allocation problems of second-order systems over weight-balanced communication networks. In the first problem, the decisions of agents are coupled by network resource constraints, and in the second problem, the
Zhenhua Deng
semanticscholar +1 more source
This paper studies two distributed resource allocation problems of second-order systems over weight-balanced communication networks. In the first problem, the decisions of agents are coupled by network resource constraints, and in the second problem, the
Zhenhua Deng
semanticscholar +1 more source
Dynamic degree balanced with CPU based VM allocation policy for load balancing
Journal of Information and Optimization Sciences, 2020In cloud computing environment, Load balancing is key challenge. To address above challenge, we have proposed Dynamic Degree Balance with CPU based VM allocation policy. The proposed algorithm includes both VM allocation and task allocation.
A. Joshi, Shyamala Devi Munisamy
semanticscholar +1 more source