160 search results - page 1 / 32 » Satisfiability-Based Algorithms for Boolean Optimization |
105
click to vote
AMAI
2000
Springer
15 years 2 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...
AMAI
2004
Springer
14 years 10 months ago
2004
Springer
ICCV
2011
IEEE
13 years 10 months ago
2011
IEEE
We propose an algorithm for creating superpixels. The major step in our algorithm is simply minimizing two pseudo-boolean functions. The processing time of our algorithm on images...
CLA
2007
15 years 5 hour ago
2007
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
JAR
2011
14 years 5 months ago
2011
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...