Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

72

ICTAI
1999
IEEE

favoriteEmaildiscussreport

89views Artificial Intelligence» more ICTAI 1999»

Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers

15 years 3 months ago

Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers

Download manip.crhc.uiuc.edu

Zhe Wu, Benjamin W. Wah

Real-time Traffic

Artificial Intelligence | ICTAI 1999 |

claim paper

Related Content

» The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization

» A Lagrangian reconstruction of GENET

» Constrained genetic algorithms and their applications in nonlinear constrained optimizatio...

» Solving Discrete Logarithms from Partial Knowledge of the Key

» The wordlength determination problem of linear time invariant systems with multiple output...

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	ICTAI
Authors	Zhe Wu, Benjamin W. Wah

Comments (0)