436 search results - page 35 / 88 » Recursion and Complexity |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
AML
1999
13 years 7 months ago
1999
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
JUCS
2002
13 years 7 months ago
2002
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper we propose a novel parameterized interconnect order reduction algorithm, CORE, to efficiently capture both inter-die and intra-die variations. CORE applies a two-ste...
ALMOB
2006
13 years 7 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...