Остановите войну!
for scientists:
default search action
Chih-Chun Wang
- > Home > Persons > Chih-Chun Wang
Publications
- 2023
- [j38]Cho-Hsin Tsai, Chih-Chun Wang:
Distribution-Oblivious Online Algorithms for Age-of-Information Penalty Minimization. IEEE/ACM Trans. Netw. 31(4): 1779-1794 (2023) - 2022
- [j34]Cho-Hsin Tsai, Chih-Chun Wang:
Unifying AoI Minimization and Remote Estimation - Optimal Sensor/Controller Coordination With Random Two-Way Delay. IEEE/ACM Trans. Netw. 30(1): 229-242 (2022) - 2021
- [c65]Cho-Hsin Tsai, Chih-Chun Wang:
Jointly Minimizing AoI Penalty and Network Cost Among Coexisting Source-Destination Pairs. ISIT 2021: 3255-3260 - 2020
- [c61]Cho-Hsin Tsai, Chih-Chun Wang:
Unifying AoI Minimization and Remote Estimation - Optimal Sensor/Controller Coordination with Random Two-way Delay. INFOCOM 2020: 466-475 - [c59]Cho-Hsin Tsai, Chih-Chun Wang:
Age-of-Information Revisited: Two-way Delay and Distribution-oblivious Online Algorithm. ISIT 2020: 1782-1787 - 2018
- [c53]Jia Zhang, Chih-Chun Wang:
On The Rate-Cost of Gaussian Linear Control Systems with Random Communication Delays. ISIT 2018: 2441-2445 - 2017
- [j28]Wei-Cheng Kuo, Chih-Chun Wang:
Robust and Optimal Opportunistic Scheduling for Downlink Two-Flow Network Coding With Varying Channel Quality and Rate Adaptation. IEEE/ACM Trans. Netw. 25(1): 465-479 (2017) - 2016
- [i15]Wei-Cheng Kuo, Chih-Chun Wang:
Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation (New Simulation Figures). CoRR abs/1606.04205 (2016) - 2014
- [c42]Wei-Cheng Kuo, Chih-Chun Wang:
Robust and optimal opportunistic scheduling for downlink 2-flow inter-session network coding with varying channel quality. INFOCOM 2014: 655-663 - [i11]Wei-Cheng Kuo, Chih-Chun Wang:
Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation. CoRR abs/1410.1851 (2014) - 2013
- [j21]Wei-Cheng Kuo, Chih-Chun Wang:
Two-Flow Capacity Region of the COPE Principle for Wireless Butterfly Networks With Broadcast Erasure Channels. IEEE Trans. Inf. Theory 59(11): 7553-7575 (2013) - 2012
- [j19]Gyu Bum Kyung, Chih-Chun Wang:
Finding the Exhaustive List of Small Fully Absorbing Sets and Designing the Corresponding Low Error-Floor Decoder. IEEE Trans. Commun. 60(6): 1487-1498 (2012) - [c36]Gyu Bum Kyung, Chih-Chun Wang:
On the error-prone substructures for the binary-input ternary-output channel and its corresponding exhaustive search algorithm. ICC 2012: 2233-2237 - 2011
- [j13]Gyu Bum Kyung, Chih-Chun Wang:
Toward a Practical Scheme for Binary Broadcast Channels with Varying Channel Quality Using Dirty Paper Coding. IEEE Trans. Commun. 59(4): 1009-1018 (2011) - [c27]Wei-Cheng Kuo, Chih-Chun Wang:
On the capacity of 2-user 1-hop relay erasure networks - The union of feedback, scheduling, opportunistic routing, and network coding. ISIT 2011: 1337-1341 - 2010
- [c21]Gyu Bum Kyung, Chih-Chun Wang:
Exhaustive search for small fully absorbing sets and the corresponding low error-floor decoder. ISIT 2010: 739-743 - 2009
- [c15]Gyu Bum Kyung, Chih-Chun Wang:
On the designs and challenges of practical binary dirty paper coding. WCNC 2009: 895-900
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint