Showing cs.AIShow all
3 papers · 1 filter
cs.AI2024
Local Search for Integer Quadratic Programming
Xiang He, Peng Lin, Shaowei Cai
Integer Quadratic Programming (IQP) is an important problem in operations research. Local search is a powerful method for solving hard problems, but the research on local search al…
cs.AI2024
OPTDTALS: Approximate Logic Synthesis via Optimal Decision Trees Approach
Hao Hu, Shaowei Cai
The growing interest in Explainable Artificial Intelligence (XAI) motivates promising studies of computing optimal Interpretable Machine Learning models, especially decision trees.…
cs.AI2024
ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization
Zhihan Chen, Peng Lin, Hao Hu +1
As a broadly applied technique in numerous optimization problems, recently, local search has been employed to solve Pseudo-Boolean Optimization (PBO) problem. A representative loca…