Chi-Yeh Chen

Orcid: 0000-0001-9664-8538

According to our database1, Chi-Yeh Chen authored at least 23 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient Approximation Algorithms for Scheduling Coflows With Total Weighted Completion Time in Identical Parallel Networks.
IEEE Trans. Cloud Comput., 2024

2023
Scheduling coflows for minimizing the total weighted completion time in heterogeneous parallel networks.
J. Parallel Distributed Comput., December, 2023

Improved Approximation Coflows Scheduling Algorithms for Minimizing the Total Weighted Completion Time and Makespan in Heterogeneous Parallel Networks.
CoRR, 2023

Improved Approximation Algorithms for Minimizing the Total Weighted Completion Time of Coflows.
CoRR, 2023

Generalize Synchronization Mechanism: Specification, Properties, Limits.
CoRR, 2023

Efficient Approximation Algorithms for Scheduling Coflows with Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time.
CoRR, 2023

Scheduling Coflows for Minimizing the Makespan in Identical Parallel Networks.
CoRR, 2023

2022
An improved algorithm for the Steiner tree problem with bounded edge-length.
J. Comput. Syst. Sci., 2022

Development of Automatic Endotracheal Tube and Carina Detection on Portable Supine Chest Radiographs using Artificial Intelligence.
CoRR, 2022

Scheduling Coflows with Precedence Constraints for Minimizing the Total Weighted Completion Time in Identical Parallel Networks.
CoRR, 2022

Scheduling Coflows for Minimizing the Total Weighted Completion Time in Identical Parallel Networks.
CoRR, 2022

2021
Matching Cut in Graphs with Large Minimum Degree.
Algorithmica, 2021

2020
Divisible Nonlinear Load Distribution on Complete b-Ary Trees.
IEEE Trans. Aerosp. Electron. Syst., 2020

An Efficient Approximation Algorithm for the Steiner Tree Problem.
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

2018
An Improved Approximation for Scheduling Malleable Tasks with Precedence Constraints via Iterative Method.
IEEE Trans. Parallel Distributed Syst., 2018

Divisible Nonlinear Load Distribution on Heterogeneous Single-Level Trees.
IEEE Trans. Aerosp. Electron. Syst., 2018

2017
An Efficient Approximation Algorithm for the Steiner Tree Problem.
CoRR, 2017

Scheduling divisible loads on heterogeneous linear networks using pipelined communications.
Proceedings of the Joint 17th World Congress of International Fuzzy Systems Association and 9th International Conference on Soft Computing and Intelligent Systems, 2017

2016
Task Scheduling for Maximizing Performance and Reliability Considering Fault Recovery in Heterogeneous Distributed Systems.
IEEE Trans. Parallel Distributed Syst., 2016

A Novel Computational Model for Non-Linear Divisible Loads on a Linear Network.
IEEE Trans. Computers, 2016

2015
Novel Methods for Divisible Load Distribution with Start-Up Costs on a Complete b-Ary Tree.
IEEE Trans. Parallel Distributed Syst., 2015

2013
A 3.42-Approximation Algorithm for Scheduling Malleable Tasks under Precedence Constraints.
IEEE Trans. Parallel Distributed Syst., 2013

2007
Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment.
IEEE Trans. Parallel Distributed Syst., 2007


  Loading...