198 search results - page 39 / 40 » Time Equations for Lazy Functional (Logic) Languages |
ICDT
2010
ACM
14 years 2 months ago
2010
ACM
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...
ICS
2009
Tsinghua U.
14 years 10 days ago
2009
Tsinghua U.
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
ML
2011
ACM
13 years 23 hour ago
2011
ACM
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
We consider the issue of representing coalitional games in multiagent systems that exhibit externalities from coalition formation, i.e., systems in which the gain from forming a c...
POPL
2005
ACM
14 years 5 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...