130 search results - page 1 / 26 » Using Higher Levels of Abstraction for Solving Optimization ... |
ISVLSI
2008
IEEE
13 years 11 months ago
2008
IEEE
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
AMAI
2000
Springer
13 years 8 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
DATE
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract--Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesig...
EMO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in ma...