7 papers
A general optimization solver based on OP-to-MaxSAT reduction
Yuxin Zhao, Han Huang, Zhifeng Hao
Optimization problems are fundamental in diverse fields, such as engineering, economics, and scientific computing. However, current algorithms are mostly designed for specific prob…
Generalizing Unit Commitment Problem Solving via SAT-based Decoupling
Yuxin Zhao, Han Huang, Fangji Fu +1
As the cornerstone of modern power systems, the Unit Commitment Problem (UC) is critical for ensuring operational security and economic efficiency in the ongoing global energy tran…
Biochemical Computing Mode for Sequential Logic
Han Huang, Chengzhi Ma, Yuxin Zhao +4
Recent years have witnessed the growing scholarly interest in the next-generation general-purpose computers. Various innovative computing modes have been proposed, such as optical,…
Running-time Analysis of () Evolutionary Combinatorial Optimization Based on Multiple-gain Estimation
Min Huang, Pengxiang Chen, Han Huang +3
The running-time analysis of evolutionary combinatorial optimization is a fundamental topic in evolutionary computation. However, theoretical results regarding the evolut…
An Experimental Approach for Running-Time Estimation of Multi-objective Evolutionary Algorithms in Numerical Optimization
Han Huang, Tianyu Wang, Chaoda Peng +2
Multi-objective evolutionary algorithms (MOEAs) have become essential tools for solving multi-objective optimization problems (MOPs), making their running time analysis crucial for…
Zero-Shot NAS via the Suppression of Local Entropy Decrease
Ning Wu, Han Huang, Yueting Xu +1
Architecture performance evaluation is the most time-consuming part of neural architecture search (NAS). Zero-Shot NAS accelerates the evaluation by utilizing zero-cost proxies ins…