徐超
發(fā)布時間: 2020-12-02 17:39:54 瀏覽量:
長沙理工大學計算機與通信工程學研究生導師基本信息表 |
|||||
1、個人基本信息: |
|||||
姓 名:徐超 |
性 別:男 |
|
|||
出生年月:1986.11 |
技術職稱:講師 |
||||
畢業(yè)院校:中南大學 |
學歷(學位):博士 |
||||
所在學科: 計算機科學與技術 |
研究方向: 計算機優(yōu)化算法 |
||||
2、教育背景: |
|||||
2005 |
湘潭大學 |
學士 |
|||
2011 |
中南大學 |
碩士 |
|||
2014 |
中南大學 |
博士 |
|||
3、目前研究領域: |
|||||
計算機優(yōu)化算法 |
|||||
4、已完成或已在承擔的主要課題: |
|||||
1. 國家自然科學基金青年項目,62002032,基于消除替換的可滿足性相關問題參數(shù)算法研究,2021/01-2023/12,主持 |
|||||
5、已出版的主要著作: |
|||||
6、已發(fā)表的學術論文: |
|||||
1. Jianer Chen, Chao Xu, Jianxin Wang*, Dealing with 4-variables by Resolution: An Improved MaxSAT Algorithm, Theoretical Computer Science, 670, 33-44, 2017,. 2. Chao Xu, Jianer Chen, Jianxin Wang*, Resolution and Linear CNF Formulas: Improved (n, 3)- MaxSAT Algorithms, Theoretical Computer Science, 774, 113-123, 2019. 3. Chao Xu, Wenjun Li, Jianxin Wang, Yongjie Yang*, An Improved Algorithm for the (n,3)- MaxSAT Problem: Asking Branchings to Satisfy the Clauses, Journal of Combinatorial and Optimization, 2019. 4. Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen*, An Effective Branching Strategy Based on Structural Relationship Among Multiple Forbidden Induced Subgraphs, Journal of Combinatorial and Optimization, 29(1), 257-275, 2015. 5. Chao Xu, Wenjun Li, Yongjie Yang, Jianer Chen, Jianxin Wang*, Resolution and Domination: An Improved Exact MaxSAT Algorithm, Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), 2019.8, 1191-1197, Macao, 2019. |
|||||
7、所獲學術榮譽及學術影響: |
|||||