706 search results - page 3 / 142 » On a quasi-ordering on Boolean functions |
GECCO
2006
Springer
13 years 9 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...
CI
2004
13 years 5 months ago
2004
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
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...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...