Sciweavers

2303 search results - page 299 / 461
» On the logic of argumentation theory
Sort
View
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
16 years 1 months ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller
EUROMICRO
1998
IEEE
15 years 10 months ago
The Latency Hiding Effectiveness of Decoupled Access/Execute Processors
Several studies have demonstrated that out-of-order execution processors may not be the most adequate organization for wide issue processors due to the increasing penalties that w...
Joan-Manuel Parcerisa, Antonio González
PLILP
1992
Springer
15 years 10 months ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft
ICALP
2010
Springer
15 years 8 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
LREC
2010
165views Education» more  LREC 2010»
15 years 8 months ago
Corpus-based Semantics of Concession: Where do Expectations Come from?
In this paper, we discuss our analysis and resulting new annotations of Penn Discourse Treebank (PDTB) data tagged as Concession. Concession arises whenever one of the two argumen...
Livio Robaldo, Eleni Miltsakaki, Alessia Bianchini