380 search results - page 52 / 76 » Mapping Problems with Finite-Domain Variables into Problems ... |
138
click to vote
BMCBI
2006
15 years 1 months ago
2006
Background: Comparison of large protein datasets has become a standard task in bioinformatics. Typically researchers wish to know whether one group of proteins is significantly en...
96
Voted
SAT
2007
Springer
15 years 8 months ago
2007
Springer
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
107
Voted
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
134
Voted
FORMATS
2004
Springer
15 years 7 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
115
click to vote
PKDD
1999
Springer
15 years 6 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...