4255 search results - page 67 / 851 » On Learning Boolean Functions |
141
click to vote
DAC
2003
ACM
16 years 6 months ago
2003
ACM
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
139
click to vote
DSD
2006
IEEE
15 years 11 months ago
2006
IEEE
We propose a novel two-level Boolean minimizer coming in succession to our previously developed minimizer BOOM, so we have named it BOOM-II. It is a combination of two minimizers,...
161
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in PseudoBoolean Opti...
150
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
129
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...