Sciweavers

3 search results - page 1 / 1
» Two-Stage Optimisation in the Design of Boolean Functions
Sort
View
ACISP
2000
Springer
13 years 9 months ago
Two-Stage Optimisation in the Design of Boolean Functions
This paper shows how suitable choice of cost function can significantly affect the power of optimisation methods for the synthesising of Boolean functions. In particular we show ...
John A. Clark, Jeremy Jacob
GECCO
2009
Springer
13 years 11 months ago
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
Philipp Rohlfshagen, Per Kristian Lehre, Xin Yao
DAC
2007
ACM
14 years 6 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne