( en | de | ru )

 

Disambiguation of "Li, Chu Min"

Author of the publication

copydeleteadd this publication to your clipboard
Towards Solving Many-Valued MaxSAT.

, , , , and . ISMVL, page 26. IEEE Computer Society, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Li Chu

Min Li

Min-chü Han

Li-Qiang Chu

Tse-Li Chu

 

Other publications of authors with the same name

A Switching Criterion for Intensification and Diversification in Local Search for SAT., , and . J. Satisf. Boolean Model. Comput., 4 (2-4): 219-237 (2008)Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem., , , , and . CoRR, (2022)Solving longest common subsequence problems via a transformation to the maximum clique problem., , , , , , and . Comput. Oper. Res., (2021)Analysis and Generation of Pseudo-Industrial MaxSAT Instances., , , and . CCIA, volume 248 of Frontiers in Artificial Intelligence and Applications, page 173-184. IOS Press, (2012)A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems., , , and . AAAI, page 2392-2399. AAAI Press, (2020)An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem., and . AAAI, page 128-133. AAAI Press, (2010)Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem., , , , and . AAAI, page 12445-12452. AAAI Press, (2021)An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs., , and . AAAI, page 830-838. AAAI Press, (2017)From Non-Clausal to Clausal MinSAT., , , and . CCIA, volume 339 of Frontiers in Artificial Intelligence and Applications, page 27-36. IOS Press, (2021)U-Log = datalog + constraints., , and . JFPLC, page 369-372. (1995)