Sciweavers

2076 search results - page 242 / 416
» Functional logic overloading
Sort
View
ESOP
2012
Springer
14 years 2 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
16 years 6 months ago
Timing Yield Calculation Using an Impulse-Train Approach
This paper presents a new method to compute the probability distribution of the delay of a combinational circuit and uses it obtain an estimate of the yield of the process that ma...
Srinath R. Naidu
ICCAD
2007
IEEE
115views Hardware» more  ICCAD 2007»
16 years 3 months ago
Timing optimization by restructuring long combinatorial paths
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
Jürgen Werber, Dieter Rautenbach, Christian S...
FUZZIEEE
2007
IEEE
16 years 23 days ago
Prototype-less Fuzzy Clustering
Abstract—In contrast to standard fuzzy clustering, which optimizes a set of prototypes, one for each cluster, this paper studies fuzzy clustering without prototypes. Starting fro...
Christian Borgelt
FUZZIEEE
2007
IEEE
16 years 23 days ago
Blockwise Similarity in [0, 1] via Triangular Norms and Sugeno Integrals - Application to Cluster Validity
— In many fields, e.g. decision-making, numerical values in [0,1] are available and one is often interested in detecting which are similar. In this paper, we propose an operator...
Hoel Le Capitaine, Thomas Batard, Carl Frél...