MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Chu Min Li – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

22 documents found, showing 1 through 10. Next 10 →

ATOM

A Constraint-Based Approach to Narrow Search Trees for Satisfiability
by Chu Min Li — 1999 — Information Processing Letters
…A Constraint-Based Approach to Narrow Search Trees for Satisability Chu Min LI 1 LaRIA, Universit…
Cited by 16 (4 self) – Add To MetaCart

Equivalency reasoning to solve a class of hard SAT problems
by Chu Min Li — 1999 — Information Processing Letters
… Equivalency Reasoning to Solve a Class of Hard Sat Problems Chu Min LI 1 LaRIA, Universit'e de…
Cited by 6 (0 self) – Add To MetaCart

Look-ahead versus look-back for satisfiability problems
by Chu Min Li, Anbulagan — 1997 — THIRD INTERNATIONAL CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, LECTURE NOTES IN COMPUTER SCIENCE
…Look-Ahead Versus Look-Back for Satis ability Problems Chu Min Li and Anbulagan LaRIA, Universite…
Cited by 48 (1 self) – Add To MetaCart

Why a Random 3-SAT Problem is Harder Than Another?
by Chu Min Li
…Why a Random 3-SAT Problem is Harder Than Another? Chu Min Li & Anbulagan LaRIA, Universite de…
Add To MetaCart

Integrating Equivalency Reasoning into Davis-Putnam Procedure
by Chu Min Li — 2000
…Integrating Equivalency Reasoning into Davis-Putnam Procedure Chu Min Li LaRIA, Univ. de Picardie…
Cited by 70 (3 self) – Add To MetaCart

Heuristics based on unit propagation for satisfiability problems
by Chu Min Li — 1997
…Heuristics Based on Unit Propagation for Satis ability Problems Chu Min Li & Anbulagan LaRIA, Univ…
Cited by 95 (11 self) – Add To MetaCart

On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT
by Chu Min Li, Sylvain Gérard — 2000 — In Proc. of European Conf. on Artificial Intelligence
…On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT Chu Min Li 1 and Sylvain G…
Cited by 8 (0 self) – Add To MetaCart

Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers
by Chu Min Li, Jordi Planes — 2005 — In Proc. 11th Principles and Practice of Constraint Programming
… Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers? Chu Min…
Cited by 18 (7 self) – Add To MetaCart

Domain adaptation for TTS systems
by Min Chu, Chun Li, Hu Peng, Eric Chang — 2002 — Proc. ICASSP
…DOMAIN ADAPTATION FOR TTS SYSTEMS Min Chu, Chun Li * , Hu Peng and Eric Chang Microsoft Research…
Cited by 2 (0 self) – Add To MetaCart

Parallelizing Satz Using Dynamic Workload Balancing
by Bernard Jurkowiak, Chu Min Li, Gil Utard — 2001 — In Proceedings of Workshop on Theory and Applications of Satisfiability Testing (SAT’2001
… Parallelizing Satz Using Dynamic Workload Balancing Bernard Jurkowiak, Chu Min Li and Gil Utard…
Cited by 9 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB