default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChi-Yeh Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Chi-Yeh Chen
:
Efficient Approximation Algorithms for Scheduling Coflows With Total Weighted Completion Time in Identical Parallel Networks. IEEE Trans. Cloud Comput. 12(1): 116-129 (2024)- [j12]Chi-Yeh Chen:
Efficient Approximation Algorithms for Scheduling Coflows With Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time. IEEE Trans. Serv. Comput. 17(5): 2349-2364 (2024) - 2023
- [j11]Chi-Yeh Chen:
Scheduling coflows for minimizing the total weighted completion time in heterogeneous parallel networks. J. Parallel Distributed Comput. 182: 104752 (2023) - [i11]Jun Chen, Chi-Yeh Chen:
Scheduling Coflows for Minimizing the Makespan in Identical Parallel Networks. CoRR abs/2302.06846 (2023) - [i10]Chi-Yeh Chen:
Efficient Approximation Algorithms for Scheduling Coflows with Total Weighted Completion Time in Identical Parallel Networks. CoRR abs/2306.02293 (2023) - [i9]Chi-Yeh Chen:
Efficient Approximation Algorithms for Scheduling Coflows with Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time. CoRR abs/2307.04107 (2023) - [i8]Chih-Wei Chien, Chi-Yeh Chen:
Generalize Synchronization Mechanism: Specification, Properties, Limits. CoRR abs/2309.11972 (2023) - [i7]Chi-Yeh Chen:
Improved Approximation Algorithms for Minimizing the Total Weighted Completion Time of Coflows. CoRR abs/2311.11296 (2023) - [i6]Chi-Yeh Chen:
Improved Approximation Coflows Scheduling Algorithms for Minimizing the Total Weighted Completion Time and Makespan in Heterogeneous Parallel Networks. CoRR abs/2312.16413 (2023) - 2022
- [j10]Chi-Yeh Chen, Sun-Yuan Hsieh:
An improved algorithm for the Steiner tree problem with bounded edge-length. J. Comput. Syst. Sci. 123: 20-36 (2022) - [i5]Chi-Yeh Chen:
Scheduling Coflows for Minimizing the Total Weighted Completion Time in Identical Parallel Networks. CoRR abs/2204.02651 (2022) - [i4]Chi-Yeh Chen:
Scheduling Coflows for Minimizing the Total Weighted Completion Time in Heterogeneous Parallel Networks. CoRR abs/2204.07799 (2022) - [i3]Chi-Yeh Chen:
Scheduling Coflows with Precedence Constraints for Minimizing the Total Weighted Completion Time in Identical Parallel Networks. CoRR abs/2205.02474 (2022) - [i2]Chi-Yeh Chen, Min-Hsin Huang, Yung-Nien Sun, Chao-Han Lai:
Development of Automatic Endotracheal Tube and Carina Detection on Portable Supine Chest Radiographs using Artificial Intelligence. CoRR abs/2206.03017 (2022) - 2021
- [j9]Chi-Yeh Chen, Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
Matching Cut in Graphs with Large Minimum Degree. Algorithmica 83(5): 1238-1255 (2021) - [e1]Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee:
Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings. Lecture Notes in Computer Science 13025, Springer 2021, ISBN 978-3-030-89542-6 [contents] - 2020
- [j8]Chi-Yeh Chen:
Divisible Nonlinear Load Distribution on Complete b-Ary Trees. IEEE Trans. Aerosp. Electron. Syst. 56(2): 998-1013 (2020) - [c2]Chi-Yeh Chen, Sun-Yuan Hsieh:
An Efficient Approximation Algorithm for the Steiner Tree Problem. Complexity and Approximation 2020: 238-251
2010 – 2019
- 2018
- [j7]Chi-Yeh Chen, Chih-Ping Chu:
Divisible Nonlinear Load Distribution on Heterogeneous Single-Level Trees. IEEE Trans. Aerosp. Electron. Syst. 54(4): 1664-1678 (2018) - [j6]Chi-Yeh Chen:
An Improved Approximation for Scheduling Malleable Tasks with Precedence Constraints via Iterative Method. IEEE Trans. Parallel Distributed Syst. 29(9): 1937-1946 (2018) - 2017
- [c1]Chi-Yeh Chen:
Scheduling divisible loads on heterogeneous linear networks using pipelined communications. IFSA-SCIS 2017: 1-6 - [i1]Chi-Yeh Chen:
An Efficient Approximation Algorithm for the Steiner Tree Problem. CoRR abs/1709.03867 (2017) - 2016
- [j5]Chi-Yeh Chen, Chih-Ping Chu:
A Novel Computational Model for Non-Linear Divisible Loads on a Linear Network. IEEE Trans. Computers 65(1): 53-65 (2016) - [j4]Chi-Yeh Chen:
Task Scheduling for Maximizing Performance and Reliability Considering Fault Recovery in Heterogeneous Distributed Systems. IEEE Trans. Parallel Distributed Syst. 27(2): 521-532 (2016) - 2015
- [j3]Chi-Yeh Chen, Chih-Ping Chu:
Novel Methods for Divisible Load Distribution with Start-Up Costs on a Complete b-Ary Tree. IEEE Trans. Parallel Distributed Syst. 26(10): 2836-2848 (2015) - 2013
- [j2]Chi-Yeh Chen, Chih-Ping Chu:
A 3.42-Approximation Algorithm for Scheduling Malleable Tasks under Precedence Constraints. IEEE Trans. Parallel Distributed Syst. 24(8): 1479-1488 (2013)
2000 – 2009
- 2007
- [j1]Yeim-Kuan Chang, Jia-Hwa Wu, Chi-Yeh Chen, Chih-Ping Chu:
Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment. IEEE Trans. Parallel Distributed Syst. 18(11): 1618-1629 (2007)
Coauthor Index
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 2025-01-20 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
