Sciweavers

160 search results - page 7 / 32
» Satisfiability-Based Algorithms for Boolean Optimization
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 3 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
EC
2008
153views ECommerce» more  EC 2008»
14 years 9 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
JAR
2006
236views more  JAR 2006»
14 years 9 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
15 years 4 months ago
An evolutionary multiobjective approach to design highly non-linear Boolean functions
The proliferation of all kinds of devices with different security requirements and constraints, and the arms-race nature of the security problem are increasingly demanding the de...
Hernán E. Aguirre, Hiroyuki Okazaki, Yasush...
DATE
2006
IEEE
145views Hardware» more  DATE 2006»
15 years 4 months ago
Building a better Boolean matcher and symmetry detector
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...
Donald Chai, Andreas Kuehlmann