Sciweavers

10054 search results - page 1721 / 2011
» On the Complexity of Function Learning
Sort
View
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
15 years 9 months ago
Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
Nicola Nicolici, Bashir M. Al-Hashimi
175
Voted
EUROMICRO
1999
IEEE
15 years 9 months ago
Software Synthesis for System Level Design Using Process Execution Trees
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
Leo J. van Bokhoven, Jeroen Voeten, Marc Geilen
138
Voted
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
15 years 9 months ago
Multi-objective design strategy for high-level low power design of DSP systems
High-level power design presents a complex, multiobjective problem that involves the simultaneous optimisation of competing criteria such as speed, area and power. It is difficult...
Mark S. Bright, Tughrul Arslan
159
Voted
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
15 years 9 months ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski
132
Voted
COCOON
1999
Springer
15 years 9 months ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman
« Prev « First page 1721 / 2011 Last » Next »