Xingfu Li
Orcid: 0000-0001-9606-7573
According to our database1,
Xingfu Li
authored at least 20 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
MTLink: Adaptive multi-task learning based pre-trained language model for traceability link recovery between issues and commits.
J. King Saud Univ. Comput. Inf. Sci., February, 2024
An empirical study on the state-of-the-art methods for requirement-to-code traceability link recovery.
J. King Saud Univ. Comput. Inf. Sci., 2024
MLTracer: An Approach Based on Multi-Layered Gradient Boosting Decision Trees for Requirements Traceability Recovery.
Proceedings of the International Joint Conference on Neural Networks, 2024
2023
A Systematic Mapping Study of Machine Learning Techniques Applied to Software Traceability.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2023
DF4RT: Deep Forest for Requirements Traceability Recovery Between Use Cases and Source Code.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2023
Applications of Machine Learning in Requirements Traceability: A Systematic Mapping Study (S).
Proceedings of the 35th International Conference on Software Engineering and Knowledge Engineering, 2023
An Empirical Study on Data Balancing in Machine Learning Based Software Traceability Methods.
Proceedings of the International Joint Conference on Neural Networks, 2023
2022
Axioms, 2022
Appl. Math. Comput., 2022
2021
J. Appl. Math. Comput., October, 2021
J. Comput. Syst. Sci., 2021
2020
Appl. Math. Comput., 2020
2018
Solving the maximum internal spanning tree problem on interval graphs in polynomial time.
Theor. Comput. Sci., 2018
Construction of Multilayer Porous Scaffold Based on Magnetically Guided Assembly of Microfiber.
J. Syst. Sci. Complex., 2018
2016
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016
2014
A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices.
CoRR, 2014
Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014