default search action
Ching-Chih Han
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
- [j12]Bin Wang, Jennifer C. Hou, Ching-Chih Han:
Design and Analysis of a Channel Access Protocol for WDM-Based Single-Hop Optical Networks. Photonic Netw. Commun. 6(3): 289-308 (2003) - [j11]Ching-Chih Han, Kang G. Shin, Jian Wu:
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults. IEEE Trans. Computers 52(3): 362-372 (2003) - 2002
- [j10]Bin Wang, Jennifer C. Hou, Ching-Chih Han:
On dynamically establishing and terminating isochronous message streams in WDM star-based lightwave networks. J. High Speed Networks 11(1): 45-66 (2002) - 2001
- [j9]Hung-Ying Tyan, Jennifer C. Hou, Bin Wang, Ching-Chih Han:
On Supporting Temporal Quality of Service in WDMA-Based Star-Coupled Optical Networks. IEEE Trans. Computers 50(3): 197-214 (2001) - [j8]Ching-Chih Han, Kang G. Shin, Chao-Ju Hou:
Synchronous Bandwidth Allocation for Real-Time Communications with the Timed-Token MAC Protocol. IEEE Trans. Computers 50(5): 414-431 (2001) - 2000
- [j7]Ching-Chih Han, Kang G. Shin, Sang Kyun Yun:
On Load Balancing in Multicomputer/Distributed Systems Equipped with Circuit or Cut-Through Switching Capability. IEEE Trans. Computers 49(9): 947-957 (2000) - [j6]Ching-Chih Han, Chao-Ju Hou, Kar Shun Tsoi, Sean Ho:
Dynamic Establishment and Termination of Real-Time Message Streams in Dual-Bus Networks. IEEE Trans. Computers 49(10): 1110-1119 (2000)
1990 – 1999
- 1998
- [c17]Yi Ye, Chao-Ju Hou, Ching-Chih Han:
QGMA: A New MAC Protocol for Supporting QoS in Wireless Local Area Networks. ICNP 1998: 339-348 - 1997
- [j5]Ching-Chih Han, Chao-Ju Hou, Kang G. Shin:
On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks. IEEE Trans. Computers 46(7): 756-767 (1997) - [c16]Chao-Ju Hou, Ching-Chih Han, Yao-Min Chen:
Communication Middleware and Software for QoS Control in Distributed Real-Time EnvironmentsSpecifically, we consider the following innovative research components. COMPSAC 1997: 558-564 - [c15]Bin Wang, Chao-Ju Hou, Ching-Chih Han:
On Dynamically Establishing and Terminating Isochronous Message Streams in WDMA-Based Local Area Lightwave Networks. INFOCOM 1997: 1261-1269 - [c14]Ching-Chih Han, Hung-Ying Tyan:
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithm. RTSS 1997: 36-45 - 1996
- [j4]Ching-Chih Han, Kwei-Jay Lin, Chao-Ju Hou:
Distance-Constrained Scheduling and Its Applications to Real-Time Systems. IEEE Trans. Computers 45(7): 814-826 (1996) - [c13]Chao-Ju Hou, Bin Wang, Ching-Chih Han:
Design and Analysis of a WDMA Protocol for Passive Star-Coupled Lightwave Networks. INFOCOM 1996: 1225-1233 - [c12]Ching-Chih Han, Kang G. Shin:
Message transmission with timing constraints in ring networks . RTSS 1996: 165-174 - [c11]Hung-Ying Tyan, Chao-Ju Hou, Bin Wang, Ching-Chih Han:
On supporting time-constrained communications in WDMA-based star-coupled optical networks. RTSS 1996: 175-184 - 1995
- [j3]Ching-Chih Han, Kwei-Jay Lin, Jane W.-S. Liu:
Scheduling Jobs with Temporal Distance Constraints. SIAM J. Comput. 24(5): 1102-1121 (1995) - [c10]Ching-Chih Han, Kang G. Shin:
A Polynominal-Time Optimal Synchronous Bandwidth Allocation Scheme for the Timed-Token MAC Protocol. INFOCOM 1995: 875-882 - [c9]Ching-Chih Han, Chao-Ju Hou, Kang G. Shin:
On Slot Allocation for Time-Constrained Messages in DQDB Networks. INFOCOM 1995: 1164-1171 - [c8]Chao-Ju Hou, Ching-Chih Han, Wun-Chun Chau:
Priority-based high-speed switch scheduling for ATM networks. LCN 1995: 19-28 - [c7]Ching-Chih Han, Kang G. Shin:
Scheduling MPEG-Compressed Video Streams with Firm Deadline Constraints. ACM Multimedia 1995: 411-422 - [c6]Ching-Chih Han, Kang G. Shin:
Real-time communication in FieldBus multiaccess networks. IEEE Real Time Technology and Applications Symposium 1995: 86-95 - [c5]Ching-Chih Han, Chao-Ju Hou, Kang G. Shin:
On Slot Reuse for Isochronous Services in DQDB Networks. RTSS 1995: 222-231 - 1994
- [c4]Ching-Chih Han, Kwei-Jay Lin:
Algorithms for scheduling computations with secondary deadlines to minimize penalty. RTS 1994: 143-148 - 1992
- [b1]Ching-Chih Han:
Scheduling Real-Time Computations With Temporal Distance and Separation Constraints and With Extended Deadlines. University of Illinois Urbana-Champaign, USA, 1992 - [j2]Ching-Chih Han, Kwei-Jay Lin:
Scheduling Real-Time Computations with Separation Constraints. Inf. Process. Lett. 42(2): 61-66 (1992) - [c3]Min-Ih Chen, Ching-Chih Han, Kwei-Jay Lin:
Scheduling Conditions for Concttrrent Real-Time Readers and Writers. IPPS 1992: 165-168 - [c2]Ching-Chih Han, Kwei-Jay Lin:
Scheduling distance-constrained real-time tasks. RTSS 1992: 300-308
1980 – 1989
- 1989
- [c1]Ching-Chih Han, Kwei-Jay Lin:
Scheduling Parallelizable Jobs on Multiprocessors. RTSS 1989: 59-67 - 1988
- [j1]Ching-Chih Han, Chia-Hoang Lee:
Comments on Mohr and Henderson's Path Consistency Algorithm. Artif. Intell. 36(1): 125-130 (1988)
Coauthor Index
aka: Chao-Ju Hou
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-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint