1146 search results - page 139 / 230 » Finite cupping sets |
LOPSTR
1994
Springer
14 years 2 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
SAS
1993
Springer
14 years 2 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
EUROCODE
1990
14 years 2 months ago
1990
: This paper deals with the effect of bit change errors on the linear complexity of finite sequences. Though a change in a single bit can cause a large change in linear complexity,...
ACSD
2007
IEEE
14 years 2 months ago
2007
IEEE
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
ASPDAC
2007
ACM
14 years 2 months ago
2007
ACM
Clock skew scheduling is a technique that intentionally introduces skews to memory elements to improve the performance of a sequential circuit. It was shown in [21] that the full ...