Results 21 to 30 of about 267,933 (307)
Proactive Random-Forest Autoscaler for Microservice Resource Allocation
Cloud service providers have been shifting their workloads to microservices to take advantage of their modularity, flexibility, agility, and scalability. However, numerous obstacles remain to achieving the most out of microservice deployments, especially
Lamees M. Al Qassem +3 more
doaj +1 more source
Balanced allocation through random walk [PDF]
We consider the allocation problem in which $m \leq (1-ε) 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(x_i),q_i=h_2(x_i)$ via hash functions $h_1,h_2$.
Alan M. Frieze, Samantha Petti
openaire +3 more sources
Popular matchings in the weighted capacitated house allocation problem [PDF]
We consider the problem of finding a popular matching in the <i>Weighted Capacitated House Allocation</i> problem (WCHA). An instance of WCHA involves a set of agents and a set of houses.
Sng, Colin T.S. +3 more
core +1 more source
Random allocation models in the thermodynamic limit
Various technical calculations have been moved to appendices, the introduction has been rewritten and some figures have been adjusted for clarity. Accepted for publication in Phys.
Piotr Bialas +2 more
openaire +4 more sources
Purpose: Evaluate the impact autologous fascial sling (AFS) and tension-free vaginal tape (TVT) procedures on quality-of-life in incontinent women. Materials and Methods: Forty-one women were randomly distributed into two groups.
Joao L. Amaro +5 more
doaj +1 more source
The recent demand for connections to a huge number of users with very high data rates have motivated research communities to investigate communications into the higher frequency bands, such as millimeter waves and TeraHertz (THz) bands.
Mohannad Alzard +3 more
doaj +1 more source
Pareto optimality in house allocation problems [PDF]
We study Pareto optimal matchings in the context of house allocation problems. We present an O(\sqrt{n}m) algorithm, based on Gales Top Trading Cycles Method, for finding a maximum cardinality Pareto optimal matching, where n is the number of agents and ...
Katarína Cechlárová +7 more
core +1 more source
A distributed algorithm for wireless resource allocation using coalitions and the Nash bargaining solution [PDF]
In this paper a distributed, low-complexity, fast and fair resource allocation algorithm for a multiuser, wireless LTE OFDMA channel is proposed. Based on the game theoretic concept of the Nash Bargaining Solution and by grouping users into coalitions of
Vatsikas, S +3 more
core +1 more source
With the incremental introduction of solar photovoltaic (PV) generators into existing power systems, and their fast-growing share in the gross electricity generation, system voltage stability has become a critical issue.
Yu Li, Masato Ishikawa
doaj +1 more source
## Purpose of the Study Resource allocation is more than the matching of two objects, but a systematic and efficient pairing process. Some experiential learning activities, like job-shadow assignments may create matching problems that can be solved with
Amit Poddar +2 more
doaj +1 more source

