Sciweavers

136 search results - page 4 / 28
» On Learning Monotone Boolean Functions
Sort
View
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
13 years 11 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
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...
Martin V. Butz, Martin Pelikan
ICALP
2009
Springer
14 years 8 months ago
Limiting Negations in Formulas
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
Hiroki Morizumi
EJC
2010
13 years 7 months ago
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
Each clone C on a fixed base set A determines a quasiorder on the set of all operations on A by the following rule: f is a C-minor of g if f can be obtained by substituting operati...
Erkko Lehtonen, Jaroslav Nesetril
RANDOM
2001
Springer
14 years 1 days ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky