295 search results - page 46 / 59 » Games and Definability for System F |
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
ICFP
2006
ACM
14 years 8 months ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
HASE
2007
IEEE
14 years 3 months ago
2007
IEEE
High assurance in embedded system software is difficult to attain. Verification relies on testing. The unreliable and costly testing process is made much worse because the softwar...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
Model-based control utilizes performance models of applications to choose performant system configurations for execution of applications. The performance models used in this resea...
CONTEXT
2001
Springer
14 years 1 months ago
2001
Springer
A recent report by the National Research Council (NRC) declares neural networks “hold the most promise for providing powerful learning models”. While some researchers have expe...