-
Chao Xu: 可满足性相关问题公共字符检索算法
Speaker: 徐超 (长沙理工大学) Time: 10:00-11:00 (Time in Beijing) February 27, 2023 (Monday) Venue: 电子科技大学清水河校区四号科研楼A区518 Abstract: 可满足性问题是计算机领域的核心问题之一。实践中常常有些化简规则，即便是多项式时间内能完成，但当检测的时间复杂度超过了平方时间，程序内多次检测访问，仍然耗时严重。为此，针对消除公共字符的化简规则，基于哈希思想，本次给出了一种快速检测的算法，希望与大家共同研讨。 Speaker Bio: 徐超，中南大学博士，长沙理工大学计算机与通信工程学院讲师，主要从事可满足性相关相关问题优化算法研究，目前专注于可满足性相关问题理论算法与求解器应用的相关工作。
-
Ye Wei & Dingwen Xu: Probability Graph Models
Speaker: () Time: 16:20-17:20 (Time in Beijing) November 25, 2022 (Friday) Venue: 518, Research Building 4 Abstract:
-
Jianbo Wang: Solving systems of linear equations through zero forcing set
Speaker: () Time: 16:20-17:20 (Time in Beijing) November 18, 2022 (Friday) Venue: 518, Research Building 4 Abstract:
-
Ke Shi: A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function
Speaker: () Time: 16:20-17:20 (Time in Beijing) October 21, 2022 (Friday) Venue: 518, Research Building 4 Abstract:
-
Yuan Fang: Multi-unit Auction over a Social Network
Speaker: () Time: 16:20-17:20 (Time in Beijing) October 14, 2022 (Friday) Venue: 518, Research Building 4 Abstract:
-
Mingyu Xiao: How Fast Can We Exactly Solve NP-Complete Problems?
Speaker: () Time: 16:20-17:20 (Time in Beijing) September 30, 2022 (Friday) Venue: 518, Research Building 4 Abstract: Speaker Bio: 2008年在香港中文大学获得计算机博士学位之后进入电子科技大学工作，现在为电子科技大学计算机学院教授，副院长。主要从事算法分析与设计、机制设计与博弈论、人工智能中的基础算法理论等方向的研究，在Information and Computation、JCSS、Algorithmica、ACM/IEEE Trans.、ICALP、IJCAI、AAAI、WWW、INCOFOM等算法、人工智能领域顶级期刊和会议上发表论文超过100篇，撰写英文专著1部，主持（完成）国家自然科学基金项目5项。是参数算法和精确算法国内外知名的学者。
-
Chao Xu: 自动化仓储系统的调度问题
Speaker: () Time: 20:00-21:00 (Time in Beijing) September 28, 2022 (Wednesday) Venue: Online, Tencent Meeting: 939-212-933 Abstract: Speaker Bio: 许超于2021年加入电子科技大学计算机科学与工程学院。现任算法与逻辑团队的助理教授。本科就读于美国纽约州立大学石溪分校数学系，于2018年在伊利诺伊大学香槟分校获得计算机博士学位。毕业后曾在多个科技和对冲基金公司担任研发科学家和软件工程师。研究方向为组合优化和算法的基础研究，相关工作发表于SODA, SICOMP, Mathematical Programming等算法和优化的知名会议和期刊。
-
Chao Xu: Minimum Violation Vertex Maps and Their Applications to Cut Problems
Speaker: () Time: 15:00-16:00 (Time in Beijing) August 19, 2022 (Friday) Venue: Online, Tencent Meeting：662-155-517 Abstract: Speaker Bio: Chao Xu is currently an Assistant Professor at Algorithms and Logic Group in UESTC. He obtained a Ph.D. degree of Computer Science at UIUC in May 2018. He works in the field of combinatorial optimization and has […]
-
Chao Xu: A polynomial time algorithm for submodular 4-partition
Speaker: () Time: 17:00-17:30 (Time in Beijing) August 16, 2022 (Tuesday) Venue: Online: https://live.bilibili.com/22051279 https://www.youtube.com/channel/UCkbCc-9vJXb4RZQA0wOPoTw/live Abstract: Speaker Bio: Chao Xu is currently an Assistant Professor at Algorithms and Logic Group in UESTC. He obtained a Ph.D. degree of Computer Science at UIUC in May 2018. He works in the area of combinatorial optimization, algorithms and […]
-
Mingyu Xiao: Solving hard problems with theoretical guarantee
Speaker: () Time: 15:00-17:00 (Time in Beijing) August 10, 2022 (Wednesday) Venue: Abstract: Speaker Bio: 2008年在香港中文大学获得计算机博士学位之后进入电子科技大学工作，现在为电子科技大学计算机学院教授，副院长。主要从事算法分析与设计、机制设计与博弈论、人工智能中的基础算法理论等方向的研究，在Information and Computation、JCSS、Algorithmica、ACM/IEEE Trans.、ICALP、IJCAI、AAAI、WWW、INCOFOM等算法、人工智能领域顶级期刊和会议上发表论文超过100篇，撰写英文专著1部，主持（完成）国家自然科学基金项目5项。是参数算法和精确算法国内外知名的学者。