Skip to main content

5 Result(s)

within Article Remove this filter Chu-Min Li Remove this filter Computer Science Remove this filter

and

  1. No Access

    Article

    Parallel Bounded Search for the Maximum Clique Problem

    Given an undirected graph, the Maximum Clique Problem (MCP) is to find a largest complete subgraph of the graph. MCP is NP-hard and has found many practical applications. In this paper, we propose a parallel B...

    Hua Jiang, Ke Bai, Hai-Jiao Liu, Chu-Min Li… in Journal of Computer Science and Technology (2023)

  2. No Access

    Article

    A branching heuristic for SAT solvers based on complete implication graphs

    The performance of modern conflict-driven clause learning (CDCL) SAT solvers strongly depends on branching heuristics. State-of-the-art branching heuristics, such as variable state independent decaying sum (VS...

    Fan **ao, Chu-Min Li, Mao Luo, Felip Manyà… in Science China Information Sciences (2019)

  3. No Access

    Article

    Resolution-based lower bounds in MaxSAT

    The lower bound (LB) implemented in branch and bound MaxSAT solvers is decisive for obtaining a competitive solver. In modern solvers like MaxSatz and MiniMaxSat, the LB relies on the cooperation of the undere...

    Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes in Constraints (2010)

  4. No Access

    Article

    Exploiting multivalued knowledge in variable selection heuristics for SAT solvers

    We show that we can design and implement extremely efficient variable selection heuristics for SAT solvers by identifying, in Boolean clause databases, sets of Boolean variables that model the same multivalued...

    Carlos Ansótegui, Jose Larrubia, Chu–Min Li… in Annals of Mathematics and Artificial Intel… (2007)

  5. No Access

    Article

    A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers

    Because of the inherent NP-completeness of SAT, many SAT problems currently cannot be solved in a reasonable time. Usually, in order to tackle a new class of SAT problems, new ad hoc algorithms must be designe...

    Bernard Jurkowiak, Chu Min Li, Gil Utard in Journal of Automated Reasoning (2005)