20 results for “Threshold-based resource allocation”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
A new stochastic load balancing model is introduced that allows for a tradeoff between non-adaptive policies and performance, with results showing a 2-reservation approximation to the omniscient optim…
This paper studies fair online resource allocation with a Lipschitz fairness requirement and proposes an algorithm to maximize welfare while enforcing fairness.
This paper studies the complexity of Value-based Task Selection (VTS) in real-time systems.
The paper proposes a resource-aware integer linear programming model to optimally allocate monitoring depth across heterogeneous network devices, balancing detection capability against computational a…
The paper extends results for interval scheduling to the more general throughput problem in the real-time model with constant competitive ratios for specific weight functions and advance notice.
This paper studies threshold minimum cut problems and provides approximation guarantees for various cases.
The paper proves that for resources with structural parallelizability (like divisibility and transferability), it is impossible to enforce a linear cost for concentrating influence, demonstrating that…
This paper studies the parameterized complexity of finding an EF1 allocation of indivisible items in the group-sharing setting.
The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.
The paper studies the problem of individually fair facility location and provides a polynomial-time algorithm with a constant cost factor.
This paper studies capacitated line aggregation with per-batch maximum delay and presents several algorithms with competitive ratios.
This paper presents algorithms for the minimum-weight mixed dominating set problem on threshold graphs, reducing it to the minimum-weight edge-cover problem and achieving running times of O(n^3) and O…
This paper proposes a new policy for multi-resource allocation in network-congested systems that considers inter-resource dependencies.
This paper studies finite-horizon queue peaks in generalized switches and provides new bounds and insights.