Zobrazeno 1 - 10
of 126
pro vyhledávání: '"STEIN, CLIFFORD"'
Autor:
Ling, Jianheng, Worah, Pratik, Wang, Yawen, Kong, Yunchuan, Wang, Chunlei, Stein, Clifford, Gupta, Diwakar, Behmer, Jason, Bush, Logan A., Ramanan, Prakash, Kumar, Rajesh, Chestna, Thomas, Liu, Yajing, Liu, Ying, Zhao, Ye, McKinley, Kathryn S., Park, Meeyoung, Maas, Martin
Scheduling virtual machines (VMs) to hosts in cloud data centers dictates efficiency and is an NP-hard problem with incomplete information. Prior work improved VM scheduling with predicted VM lifetimes. Our work further improves lifetime-aware schedu
Externí odkaz:
http://arxiv.org/abs/2412.09840
In the process of redistricting, one important metric is the number of competitive districts, that is, districts where both parties have a reasonable chance of winning a majority of votes. Competitive districts are important for achieving proportiona
Externí odkaz:
http://arxiv.org/abs/2404.10964
An important goal of modern scheduling systems is to efficiently manage power usage. In energy-efficient scheduling, the operating system controls the speed at which a machine is processing jobs with the dual objective of minimizing energy consumptio
Externí odkaz:
http://arxiv.org/abs/2402.17143
The modern network aims to prioritize critical traffic over non-critical traffic and effectively manage traffic flow. This necessitates proper buffer management to prevent the loss of crucial traffic while minimizing the impact on non-critical traffi
Externí odkaz:
http://arxiv.org/abs/2305.07164
Let $G$ be a graph and suppose we are given, for each $v \in V(G)$, a strict ordering of the neighbors of $v$. A set of matchings ${\cal M}$ of $G$ is called internally stable if there are no matchings $M,M' \in {\cal M}$ such that an edge of $M$ blo
Externí odkaz:
http://arxiv.org/abs/2211.17050
Algorithms with predictions is a recent framework that has been used to overcome pessimistic worst-case bounds in incomplete information settings. In the context of scheduling, very recent work has leveraged machine-learned predictions to design algo
Externí odkaz:
http://arxiv.org/abs/2205.01247
Longest Increasing Subsequence (LIS) is a fundamental statistic of a sequence, and has been studied for decades. While the LIS of a sequence of length $n$ can be computed exactly in time $O(n\log n)$, the complexity of estimating the (length of the)
Externí odkaz:
http://arxiv.org/abs/2112.05106
This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on $m$ identical machines. The main result is an $O(1)$ competitive deterministic algorithm for any number of
Externí odkaz:
http://arxiv.org/abs/2111.06564
For any forest $G = (V, E)$ it is possible to orient the edges $E$ so that no vertex in $V$ has out-degree greater than $1$. This paper considers the incremental edge-orientation problem, in which the edges $E$ arrive over time and the algorithm must
Externí odkaz:
http://arxiv.org/abs/2107.02318
Matching demand (riders) to supply (drivers) efficiently is a fundamental problem for ride-sharing platforms who need to match the riders (almost) as soon as the request arrives with only partial knowledge about future ride requests. A myopic approac
Externí odkaz:
http://arxiv.org/abs/2011.03624