1512 search results - page 123 / 303 » When Suboptimal Rules |
118
click to vote
PEPM
1993
ACM
15 years 3 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
CCS
2006
ACM
15 years 2 months ago
2006
ACM
The ability to automatically compose security policies created by multiple organizations is fundamental to the development of scalable security systems. The diversity of policies ...
KDD
1995
ACM
15 years 2 months ago
1995
ACM
We introduce an active data mining paradigm that combines the recent work in data mining with the rich literature on active database systems. In this paradigm, data is continuousl...
114
click to vote
RTA
1995
Springer
15 years 2 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
103
click to vote
CSL
2009
Springer
15 years 2 months ago
2009
Springer
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...