29908 search results - page 492 / 5982 » On the Complexity of |
174
click to vote
ALT
2006
Springer
16 years 4 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
195
click to vote
ICCD
2003
IEEE
16 years 4 months ago
2003
IEEE
A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. In this paper, a distributed re...
158
click to vote
ICCAD
2004
IEEE
16 years 4 months ago
2004
IEEE
It is common wisdom that synthesizing hardware from higher-level descriptions than Verilog will incur a performance penalty. The case study here shows that this need not be the ca...