552 search results - page 24 / 111 » On the Complexity of Join Predicates |
ILP
2000
Springer
14 years 1 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
ACL
1993
13 years 11 months ago
1993
We propose a distinction between two kinds of metonymy: "referential" metonymy, in which the referent of an NP is shifted, and "predicative" metonymy, in which...
POPL
2005
ACM
14 years 10 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
TACAS
2005
Springer
14 years 3 months ago
2005
Springer
ion Himanshu Jain1,2 , Franjo Ivanˇci´c1 , Aarti Gupta1 , and Malay K. Ganai1 1 NEC Laboratories America, Inc., 4 Independence Way, Princeton, NJ 08540 2 School of Computer Scien...
ISCA
1995
IEEE
14 years 1 months ago
1995
IEEE
Speculative execution is execution of instructions before it is known whether these instructions should be executed. Compiler-based speculative execution has the potential to achi...