( en | de | ru )

 

Disambiguation of "Li, Chu-Min"

Author of the publication

copydeleteadd this publication to your clipboard
Local search for diversified Top-k clique search problem.

, , , , and . Comput. Oper. Res., (2020)

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

U-Log = datalog + constraints., , and . JFPLC, page 369-372. (1995)Parallelizing Satz Using Dynamic Workload Balancing., , and . Electron. Notes Discret. Math., (2001)Applying a unified object logic model to implement a strong and dynamic interface between Prolog and an OODBMS., and . BDA, page 280-. INRIA, (1992)Look-Ahead Versus Look-Back for Satisfiability Problems., and . CP, volume 1330 of Lecture Notes in Computer Science, page 341-355. Springer, (1997)Exploiting Cycle Structures in Max-SAT., , , and . SAT, volume 5584 of Lecture Notes in Computer Science, page 467-480. Springer, (2009)A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers., , and . J. Autom. Reason., 34 (1): 73-101 (2005)A Switching Criterion for Intensification and Diversification in Local Search for SAT., , and . J. Satisf. Boolean Model. Comput., 4 (2-4): 219-237 (2008)New Inference Rules for Max-SAT, , and . CoRR, (2011)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)Solving longest common subsequence problems via a transformation to the maximum clique problem., , , , , , and . Comput. Oper. Res., (2021)