135 search results - page 5 / 27 » Bounded Synthesis |
DAC
1995
ACM
13 years 11 months ago
1995
ACM
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
MCMASTER
1993
13 years 11 months ago
1993
With the recent advances in massively parallel programmable processor networks, methods for the infusion of massive MIMD parallelism into programs have become increasingly relevant...
CDC
2009
IEEE
14 years 2 days ago
2009
IEEE
— Global asymptotic stabilization for a class of nonlinear systems is addressed. The dynamics of these systems are composed of a linear part to which is added some nonlinearities...
ASPDAC
2005
ACM
14 years 28 days ago
2005
ACM
- Many high-level description languages, such as C/C++ or Java, lack the capability to specify the bitwidth information for variables and operations. Synthesis from these specifica...
ASPDAC
1995
ACM
13 years 11 months ago
1995
ACM
In this article a scheduling method is presented which is capable of allocating supplementary resources during scheduling. This makes it very suitable in synthesis strategies base...