70 search results - page 1 / 14 » Improved Cost Function in the Design of Boolean Functions Sa... |
INDOCRYPT
2003
Springer
13 years 9 months ago
2003
Springer
We develop an improved cost function to be used in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonli...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
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...
DAC
2008
ACM
14 years 5 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
TACAS
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
WOSP
2010
ACM
13 years 4 months ago
2010
ACM
Quantitative prediction of quality properties (i.e. extrafunctional properties such as performance, reliability, and cost) of software architectures during design supports a syste...