933 search results - page 151 / 187 » Extending Forward Checking |
SACMAT
2003
ACM
14 years 1 months ago
2003
ACM
This paper presents an approach that uses special purpose RBAC constraints to base certain access control decisions on context information. In our approach a context constraint is...
DSN
2002
IEEE
14 years 1 months ago
2002
IEEE
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
LICS
2000
IEEE
14 years 26 days ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
ICALP
1994
Springer
14 years 17 days ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
ICALP
1990
Springer
14 years 16 days ago
1990
Springer
A system of hierarchical, fully recursive types in a truly imperative language allows program fragments written for small types to be reused for all larger types. To exploit this ...