1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2022
Improving the Bounds of the Online Dynamic Power Management Problem
Ya-Chun Liang, Kazuo Iwama, Chung-Shou Liao
We investigate the {\em power-down mechanism} which decides when a machine transitions between states such that the total energy consumption, characterized by execution cost, idle…
cs.DS2021
Tight Competitive Analyses of Online Car-sharing Problems
Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen +1
The car-sharing problem, proposed by Luo, Erlebach and Xu in 2018, mainly focuses on an online model in which there are two locations: 0 and 1, and total cars. Each request whi…
cs.IT2021★ 1 cited
Topological Interference Management with Adversarial Topology Perturbation: An Algorithmic Perspective
Ya-Chun Liang, Chung-Shou Liao, Xinping Yi
In this paper, we consider the topological interference management (TIM) problem in a dynamic setting, where an adversary perturbs network topology to prevent the exploitation of s…