71 search results - page 3 / 15 » Approximating Boolean Functions by OBDDs |
MFCS
1998
Springer
13 years 11 months ago
1998
Springer
In this paper we consider the problem of characterizing optimal variable orderings for shared OBDDs of two Boolean functions fi = gi i hi, i = 1, 2, where i is an operator from th...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
JACIII
2007
13 years 7 months ago
2007
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
CATS
2006
13 years 8 months ago
2006
We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed ...
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...