706 search results - page 42 / 142 » On a quasi-ordering on Boolean functions |
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
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...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
We propose a simple approach to visualising the time behaviour of Random Boolean Networks (RBNs), and demonstrate the approach by examining the effect of canalising functions for ...
ASPDAC
2005
ACM
14 years 1 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Aim of this paper is to address the problem of learning Boolean functions from training data with missing values. We present an extension of the BRAIN algorithm, called U-BRAIN (U...