Sciweavers

1117 search results - page 47 / 224
» Equivalent Representations of Set Functions
Sort
View
ICFP
2005
ACM
15 years 9 months ago
Scrap your nameplate: (functional pearl)
Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some i...
James Cheney
72
Voted
FSS
2008
94views more  FSS 2008»
14 years 9 months ago
Lattices of convex normal functions
The algebra of truth values of type-2 fuzzy sets is the set of all functions from the unit interval into itself, with operations de ned in terms of certain convolutions of these f...
John Harding, Carol L. Walker, Elbert A. Walker
LCTRTS
2000
Springer
15 years 1 months ago
Automatic Validation of Code-Improving Transformations
This paper presents a general approach to automatically validate code-improving transformations on low-level program representations. The approach ensures the correctness of compi...
Robert van Engelen, David B. Whalley, Xin Yuan
CORR
2008
Springer
112views Education» more  CORR 2008»
14 years 9 months ago
Approximating Transitivity in Directed Networks
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
TRS
2008
14 years 9 months ago
The Neurophysiological Bases of Cognitive Computation Using Rough Set Theory
A popular view is that the brain works in a similar way to a digital computer or a Universal Turing Machine by processing symbols. Psychophysical experiments and our amazing capabi...
Andrzej W. Przybyszewski