E-LIB Suche - Ergebnisse für: Kuo, Tung-Wei

1

Fair Scheduling Under Packet Management: Competitive Analys..:

, In: Algorithmics of Wireless Networks; Lecture Notes in Computer Science,

Jien, Chen-Rui ; Kuo, Tung-Wei - p. 117-132 , 2023

Link: https://doi.org/10.1007/..

2

Optimistic Fast Rerouting:

, In: ICC 2022 - IEEE International Conference on Communications,

Tan, Hai-Khun ; Kuo, Tung-Wei - p. 1692-1697 , 2022

Link: https://doi.org/10.1109/..

3

Competitive Analyses of Online Minimum Age of Information T..:

, In: IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS),

Kuo, Tung-Wei - p. 1-8 , 2022

Link: https://doi.org/10.1109/..

4

On the approximability and hardness of the minimum connecte..:

Kuo, Tung-Wei
Theoretical Computer Science. 793 (2019) - p. 140-151 , 2019

Link: https://doi.org/10.1016/..

5

On the Approximability and Hardness of the Minimum Connecte..:

, In: Algorithms for Sensor Systems; Lecture Notes in Computer Science,

Kuo, Tung-Wei - p. 32-46 , 2019

Link: https://doi.org/10.1007/..

6

Deploying Chains of Virtual Network Functions: On the Relat..:

Kuo, Tung-Wei ; Liou, Bang-Heng ; Lin, Kate Ching-Ju.
IEEE/ACM Transactions on Networking. 26 (2018) 4 - p. 1562-1576 , 2018

Link: https://doi.org/10.1109/..

7

Deploying Chains of Virtual Network Functions: On the Relat..:

Kuo, Tung-Wei ; Liou, Bang-Heng ; Lin, Kate Ching-Ju.
IEEE/ACM Transactions on Networking (TON). 26 (2018) 4 - p. 1562-1576 , 2018

Link: https://dl.acm.org/doi/1..

8

Maximizing submodular set function with connectivity constr..:

Kuo, Tung-Wei ; Lin, Kate Ching-Ju ; Tsai, Ming-Jer
IEEE/ACM Transactions on Networking (TON). 23 (2015) 2 - p. 533-546 , 2015

Link: https://dl.acm.org/doi/1..

9

Maximizing Submodular Set Function With Connectivity Constr..:

Kuo, Tung-Wei ; Lin, Kate Ching-Ju ; Tsai, Ming-Jer
IEEE/ACM Transactions on Networking. 23 (2015) 2 - p. 533-546 , 2015

Link: https://doi.org/10.1109/..

10

Balancing SRPT and FCFS via Starvation Mitigation:

Kuo, Tung-Wei
http://arxiv.org/abs/2112.14403. , 2021

Link: http://arxiv.org/abs/211..

11

Minimum Age TDMA Scheduling:

Kuo, Tung-Wei
http://arxiv.org/abs/1905.10809. , 2019

Link: http://arxiv.org/abs/190..

12

No Need for Recovery: A Simple Two-Step Byzantine Consensus:

Kuo, Tung-Wei ; Chen, Kung
http://arxiv.org/abs/1911.10361. , 2019

Link: http://arxiv.org/abs/191..

13

On the Approximability and Hardness of the Minimum Connecte..:

Kuo, Tung-Wei
http://arxiv.org/abs/1711.10680. , 2017

Link: http://arxiv.org/abs/171..

14

Leader-Contention-Based User Matching for 802.11 Multiuser ..:

Kuo, Tung-Wei ; Lee, Kuang-Che ; Lin, Kate Ching-Ju.
http://arxiv.org/abs/1404.6041. , 2014

Link: http://arxiv.org/abs/140..

15

On the Construction of Data Aggregation Tree with Minimum E..:

Kuo, Tung-Wei ; Lin, Kate Ching-Ju ; Tsai, Ming-Jer
http://arxiv.org/abs/1402.6457. , 2014

Link: http://arxiv.org/abs/140..