Sciweavers

707 search results - page 120 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
14 years 15 days ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
JEI
2000
134views more  JEI 2000»
13 years 7 months ago
Pattern matching using the blur hit - miss transform
The usefulness of the hit-miss transform (HMT) and related transforms for pattern matching in document image applications is examined. Although the HMT is sensitive to the types o...
Dan S. Bloomberg, Luc Vincent
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 12 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
13 years 11 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong
ENTCS
2006
174views more  ENTCS 2006»
13 years 8 months ago
Symbolic Reasoning with Weighted and Normalized Decision Diagrams
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
Jörn Ossowski, Christel Baier