2436 search results - page 234 / 488 » Comonadic Notions of Computation |
138
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
—This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching. As ...
148
click to vote
ADC
1999
Springer
15 years 11 months ago
1999
Springer
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...
213
click to vote
FOSSACS
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
165
click to vote
AGP
1997
IEEE
15 years 11 months ago
1997
IEEE
We present the rational construction of a generic domain for structural analysis anguages: Pattern(D ), where the parameter D is an abstract domain satisfying certain properties. ...
141
click to vote
HICSS
1997
IEEE
15 years 11 months ago
1997
IEEE
The value for decision making of high-quality postsolution analysis of decision-supporting models can hardly be overestimated. Candle-lighting analysis (CLA) takes this notion ver...