English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113656/144643 (79%)
Visitors : 51714252      Online Users : 589
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Category

    Loading community tree, please wait....

    Year

    Loading year class tree, please wait....

    Items for Author "郭桐惟"  

    Return to Browse by Author

    Showing 15 items.

    Collection Date Title Authors Bitstream
    [資訊科學系] 會議論文 2024-09 Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line 郭桐惟; Kuo, Tung-Wei
    [資訊科學系] 會議論文 2024-05 Better Clients, Less Conflicts: Hyperledger Fabric Conflict Avoidance 郭桐惟; Kuo, Tung-Wei; Ji, Bing-Jie
    [資訊科學系] 會議論文 2023-09 Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information 郭桐惟; Kuo, Tung-Wei; Jien, Chen-Rui
    [資訊科學系] 會議論文 2022-05 Competitive Analyses of Online Minimum Age of Information Transmission Scheduling 郭桐惟; Kuo, Tung-Wei
    [資訊科學系] 會議論文 2022-05 Optimistic Fast Rerouting 郭桐惟; Kuo, Tung-Wei; Tan, Hai-Khun
    [資訊科學系] 會議論文 2020 Fair VNF Provisioning in NFV Clusters via Node Labeling 郭桐惟; Kuo, Tung-Wei; Chang, Tzu-Wen; Tsai, Ming-Jer
    [資訊科學系] 會議論文 2018 MSig-BFT: A Witness-Based Consensus Algorithm for Private Blockchains 陳恭; 陳俊瑋; 蘇鑑微; 郭桐惟
    [資訊科學系] 期刊論文 2019-11 On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint 郭桐惟; Tung-Wei Kuo
    [資訊科學系] 期刊論文 2019-07 On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint 郭桐惟; Kuo, Tung-Wei
    [資訊科學系] 期刊論文 2019-02 On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint 郭桐惟; Tung-Wei Kuo
    [資訊科學系] 期刊論文 2018-08 Deploying Chains of Virtual Network Functions: On the Relation Between Link and Server Usage Kuo, Tung-Wei; 郭桐惟; Liou, Bang-Heng; Lin, Kate Ching-Ju; Tsai, Ming-Jer
    [資訊科學系] 期刊論文 2016-09 Beam Configuration and Client Association for Access Points Using Switched Beam Antennas 郭桐惟; Kuo, Tung-Wei; Jeng, Shyh-Kang; Cheng, Wan-Jie; Yan, Pei-Jiun; Lin, Kate Ching-Ju
    [資訊科學系] 期刊論文 2015-12 On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithm 郭桐惟; Kuo, Tung-Wei; Lin, Kate Ching-Ju; Tsai, Ming-Jer
    [資訊科學系] 期刊論文 2015-04 Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks 郭桐惟; Kuo, Tung-Wei; Lin, Kate Ching-Ju; Tsai, Ming-Jer
    [資訊科學系] 期刊論文 2014-04 Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Networks 郭桐惟; Kuo, Tung-Wei; Lee, Kuang-Che; Lin, Kate Ching-Ju; Tsai, Ming-Jer

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback