353 search results - page 51 / 71 » Computational Intelligence in Circuit Synthesis |
ECAL
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Developmental models simulate the spatio-temporal development of a complex system. The system described in this paper combines the advantages of a number of previously di...
DAC
2008
ACM
14 years 9 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...
ICCAD
2007
IEEE
14 years 5 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
We present several practical improvements to the interactive evolution of 2D images, some of which are also applicable to more general genetic programming problems. We introduce tr...
APN
2005
Springer
14 years 2 months ago
2005
Springer
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models allowing more...