Sciweavers

461 search results - page 60 / 93
» An Algorithm for Bi-Decomposition of Logic Functions
Sort
View
86
Voted
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 4 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
DATE
2006
IEEE
145views Hardware» more  DATE 2006»
15 years 3 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
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
15 years 10 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...
FPGA
2000
ACM
141views FPGA» more  FPGA 2000»
15 years 1 months ago
Tolerating operational faults in cluster-based FPGAs
In recent years the application space of reconfigurable devices has grown to include many platforms with a strong need for fault tolerance. While these systems frequently contain ...
Vijay Lakamraju, Russell Tessier
TVLSI
2002
102views more  TVLSI 2002»
14 years 9 months ago
Low-power data forwarding for VLIW embedded architectures
In this paper, we propose a low-power approach to the design of embedded very long instruction word (VLIW) processor architectures based on the forwarding (or bypassing) hardware, ...
Mariagiovanna Sami, Donatella Sciuto, Cristina Sil...