吴歆韵｜湖北工业大学｜学者主页

期刊论文

2026

Bridging LLMs and SAT Solving: Automated Evolution of High-Performance Heuristics

Mao Luo, Hang Ding, Chu-Min Li, Junjie Zhang, Zhiwei Ye, Zhipeng Lü, Caiquan Xiong, Xinyun Wu

International Joint Conference on Artificial Intelligence

DOI

2026

A novel clustering method for best vector generation in success history-based differential evolution

Dahai Xia, Jie Zhu, Hui Li, Xinyun Wu, Caiquan Xiong

Cluster Computing

DOI

2025

A dual-evaluation-mode local-search for the minimum dominating set problem on ultra-large sparse graphs

Yexin Peng, Mao Luo, Xinyun Wu, Caiquan Xiong, Hui Kong

The Journal of Supercomputing

DOI

2025

A memetic-based algorithm for solving stable extension in abstract argumentation frameworks

Ziwen Huang, Xinyun Wu, Caiquan Xiong

International Conference on Algorithms, Microchips, and Network Applications (AMNA)

DOI

2025

A Memetic Algorithm Integrating Argument Acceptability for Stable Extension Solving in Abstract Argumentation Frameworks

Ziwen Huang, Xinyun Wu, Caiquan Xiong

International Conference on Computer Engineering and Application (ICCEA)

DOI

2025

An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem

Mao Luo, Xianhong Liu, Xinyun Wu, Caiquan Xiong, Yuanzhi Ke

The Journal of Supercomputing

DOI

2024

求解最小双连通支配集问题的变邻域禁忌搜索算法

桂文杰，吴歆韵，熊才权

《湖北工业大学学报》

2024

An In-Label Prioritizing Variable Branching Strategy of SAT Solvers for a Preferred Extension of Argumentation Frameworks

Mao Luo, Jiao Xiong, Ningning He, Caiquan Xiong, Xinyun Wu, Jun Liang Wu

Lecture notes in computer science

DOI

2024

A Four-Label-Based Algorithm for Solving Stable Extension Enumeration in Abstract Argumentation Frameworks

Mao Luo, Ningning He, Xinyun Wu, Caiquan Xiong, Wanghao Xu

Applied Sciences

DOI

2024

Dual-Neighborhood Tabu Search for Computing Stable Extensions in Abstract Argumentation Frameworks

Yuanzhi Ke, Xiaogang Hu, Junjie Sun, Xinyun Wu, Caiquan Xiong, Mao Luo

Applied Sciences

DOI

2024

A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem

Mao Luo, Huigang Qin, Xinyun Wu, Caiquan Xiong

Journal of Combinatorial Optimization

DOI

2024

Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs

Mao Luo, Huigang Qin, Xinyun Wu, Caiquan Xiong, Dahai Xia, Yuanzhi Ke

Mathematics

DOI

2023

Dual-Neighborhood Search for Solving the Minimum Dominating Tree Problem

Ze Pan, Xinyun Wu, Caiquan Xiong

Mathematics

DOI

2023

An adaptive stochastic ranking-based tournament selection method for differential evolution

Dahai Xia, Xinyun Wu, Yan Meng, Caiquan Xiong

The Journal of Supercomputing

DOI

2023

A Memetic Approach for Classic Minimum Dominating Set Problem

Peng Rui, Xinyun Wu, Xiong Caiquan

Lecture notes on data engineering and communications technologies

DOI

2022

A two-level meta-heuristic approach for the minimum dominating tree problem

Caiquan Xiong, Hang Liu, Xinyun Wu, Na Deng

Frontiers of Computer Science

DOI

2022

An Iterative Local Search Approach of Finding the Minimum Dominating Set in IoT

Yongfeng Cheng, Xinyun Wu, Caiquan Xiong

Lecture notes in electrical engineering

DOI

2020

A Meta-Heuristic Approach for The Constraint Satisfaction Problem

Tianci Chen, Xinyun Wu

IEEE International Conference on Electronics Information and Emergency Communication

DOI

2020

Incremental Evaluation Improvements of The RSN Algorithm for the Minimum Connected Dominating Set Problem

Ziwen Liu, Xinyun Wu

IEEE International Conference on Electronics Information and Emergency Communication

DOI

2016

光网络规划问题的智能优化算法研究

吴歆韵

《华中科技大学》

预印本

2026

A dual mode collaborative local search algorithm for the Min-Max Edge Crossing Problem

Xinyun Wu, Yexin Peng, Mao Luo, Qingzhe Xia, Caiquan Xiong

SSRN Electronic Journal

DOI

吴歆韵

精选作品

期刊论文

Bridging LLMs and SAT Solving: Automated Evolution of High-Performance Heuristics

A novel clustering method for best vector generation in success history-based differential evolution

A dual-evaluation-mode local-search for the minimum dominating set problem on ultra-large sparse graphs

A memetic-based algorithm for solving stable extension in abstract argumentation frameworks

A Memetic Algorithm Integrating Argument Acceptability for Stable Extension Solving in Abstract Argumentation Frameworks

An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem

求解最小双连通支配集问题的变邻域禁忌搜索算法

An In-Label Prioritizing Variable Branching Strategy of SAT Solvers for a Preferred Extension of Argumentation Frameworks

A Four-Label-Based Algorithm for Solving Stable Extension Enumeration in Abstract Argumentation Frameworks

Dual-Neighborhood Tabu Search for Computing Stable Extensions in Abstract Argumentation Frameworks

A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem

Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs

Dual-Neighborhood Search for Solving the Minimum Dominating Tree Problem

An adaptive stochastic ranking-based tournament selection method for differential evolution

A Memetic Approach for Classic Minimum Dominating Set Problem

A two-level meta-heuristic approach for the minimum dominating tree problem

An Iterative Local Search Approach of Finding the Minimum Dominating Set in IoT

A Meta-Heuristic Approach for The Constraint Satisfaction Problem

Incremental Evaluation Improvements of The RSN Algorithm for the Minimum Connected Dominating Set Problem

光网络规划问题的智能优化算法研究

预印本

A dual mode collaborative local search algorithm for the Min-Max Edge Crossing Problem

研究方向