146 search results - page 4 / 30 » Optimally Solving the MCM Problem Using Pseudo-Boolean Satis... |
ISVLSI
2008
IEEE
15 years 3 months ago
2008
IEEE
134
click to vote
FOGA
2011
14 years 1 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
80
Voted
CP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
ASPDAC
2005
ACM
15 years 3 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
96
Voted
AMAI
2000
Springer
15 years 1 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...