Sciweavers

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

12

ISVLSI
2008
IEEE

favoriteEmaildiscussreport

142views VLSI» more ISVLSI 2008»

Using Higher Levels of Abstraction for Solving Optimization Problems by Boolean Satisfiability

13 years 10 months ago

Using Higher Levels of Abstraction for Solving Optimization Problems by Boolean Satisfiability

Download www.informatik.uni-bremen.de

Robert Wille, Daniel Große, Mathias Soeken,

Real-time Traffic

ISVLSI 2008 | VLSI |

claim paper

Related Content

» Optimally Solving the MCM Problem Using PseudoBoolean Satisfiability

» On Solving Boolean Optimization with SatisfiabilityBased Algorithms

» Verifying UMLOCL models using Boolean satisfiability

» Solving Bilevel MultiObjective Optimization Problems Using Evolutionary Algorithms

» SatisfiabilityBased Detailed FPGA Routing

» A Note on Satisfying TruthValue Assignments of Boolean Formulas

» Solving satisfiability problems with preferences

» Algorithms for Maximum Satisfiability using Unsatisfiable Cores

» A PseudoBoolean Solution to the Maximum Quartet Consistency Problem

Post Info
More Details (n/a)

Added	31 May 2010
Updated	31 May 2010
Type	Conference
Year	2008
Where	ISVLSI
Authors	Robert Wille, Daniel Große, Mathias Soeken, Rolf Drechsler

Comments (0)