8094 search results - page 9 / 1619 » Improvements in Formula Generalization |
DAM
2008
13 years 7 months ago
2008
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
MLDM
2009
Springer
14 years 2 months ago
2009
Springer
A number of two-class classification methods first discretize each attribute of two given training sets and then construct a propositional DNF formula that evaluates to True for ...
IJCNN
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— Almost all learning machines used in computational intelligence are not regular but singular statistical models, because they are nonidentifiable and their Fisher info...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...