44 search results - page 2 / 9 » The Complexity of the Optimal Variable Ordering Problems of ... |
COCOA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
GECCO
2000
Springer
14 years 4 days ago
2000
Springer
Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. Howeve...
CCL
1994
Springer
14 years 19 days ago
1994
Springer
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
EVOW
2004
Springer
14 years 1 months ago
2004
Springer
Recently, an approach has been presented to minimize Disjoint Sumof-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for larg...
ICCD
2001
IEEE
14 years 5 months ago
2001
IEEE
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...