
Search the dblp DataBase
Zhaohui Fu:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Ping Chen, Zhaohui Fu, Andrew Lim
The Yard Allocation Problem. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 2002, pp:38 [Conf]
 Zhaohui Fu, Yinlei Yu, Sharad Malik
Considering Circuit Observability Don't Cares in CNF Satisfiability. [Citation Graph (0, 0)][DBLP] DATE, 2005, pp:11081113 [Conf]
 Zhaohui Fu, Ping Chen, Andrew Lim
Using Genetic Algorithms To Solve The Yard Allocation Problem. [Citation Graph (0, 0)][DBLP] GECCO, 2002, pp:10491056 [Conf]
 Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues
The General Yard Allocation Problem. [Citation Graph (0, 0)][DBLP] GECCO, 2003, pp:19861997 [Conf]
 Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues
TwoDimensional acking For Irregular Shaped Objects. [Citation Graph (0, 0)][DBLP] HICSS, 2003, pp:86 [Conf]
 Zhaohui Fu, Sharad Malik
Solving the minimumcost satisfiability problem using SAT based branchandbound search. [Citation Graph (0, 0)][DBLP] ICCAD, 2006, pp:852859 [Conf]
 Zhaohui Fu, Andrew Lim
Heuristics for the exam scheduling problem. [Citation Graph (0, 0)][DBLP] ICTAI, 2000, pp:172175 [Conf]
 Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik
Zchaff2004: An Efficient SAT Solver. [Citation Graph (0, 0)][DBLP] SAT (Selected Papers, 2004, pp:360375 [Conf]
 Zhaohui Fu, Sharad Malik
On Solving the Partial MAXSAT Problem. [Citation Graph (0, 0)][DBLP] SAT, 2006, pp:252265 [Conf]
 Zhaohui Fu, Sharad Malik
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions. [Citation Graph (0, 0)][DBLP] VLSI Design, 2007, pp:3742 [Conf]
 Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues
The TwoDimensional Packing Problem for Irregular Objects. [Citation Graph (0, 0)][DBLP] International Journal on Artificial Intelligence Tools, 2004, v:13, n:3, pp:429448 [Journal]
 Anubhav Gupta, Kenneth L. McMillan, Zhaohui Fu
Automated Assumption Generation for Compositional Verification. [Citation Graph (0, 0)][DBLP] CAV, 2007, pp:420432 [Conf]
Search in 0.002secs, Finished in 0.003secs
