451 search results - page 10 / 91 » On Parameterized Exponential Time Complexity |
131
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
118
click to vote
DAC
2006
ACM
16 years 3 months ago
2006
ACM
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
110
click to vote
LMCS
2007
15 years 2 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
110
click to vote
EOR
2006
15 years 2 months ago
2006
In this paper we develop an open queueing network for optimal design of multi-stage assemblies, in which each service station represents a manufacturing or assembly operation. The...
135
click to vote
RECONFIG
2008
IEEE
15 years 9 months ago
2008
IEEE
1 We present a fast, efficient, and parameterized modular multiplier and a secure exponentiation circuit especially intended for FPGAs on the low end of the price range. The desig...