461 search results - page 16 / 93 » An Algorithm for Bi-Decomposition of Logic Functions |
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
A non-uniform cellular automata-based model is presented for the evolutionary development of digital circuits at the gate level. The main feature of this model is the modified lo...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
102
Voted
DATE
2000
IEEE
15 years 2 months ago
2000
IEEE
Traditional FPGA design flows have treated logic synthesis and physical design as separate steps. With the recent advances in technology, the lack of information on the physical ...
TBILLC
2005
Springer
15 years 3 months ago
2005
Springer
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the de...