Sciweavers

3468 search results - page 304 / 694
» An open logical framework
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 6 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 5 months ago
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
Eric Goles Chacc, Bruno Martin
EMNLP
2009
15 years 4 months ago
Quantifier Scope Disambiguation Using Extracted Pragmatic Knowledge: Preliminary Results
It is well known that pragmatic knowledge is useful and necessary in many difficult language processing tasks, but because this knowledge is difficult to acquire and process autom...
Prakash Srinivasan, Alexander Yates
ATVA
2006
Springer
112views Hardware» more  ATVA 2006»
15 years 10 months ago
Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
Sven Schewe
CORR
2006
Springer
136views Education» more  CORR 2006»
15 years 6 months ago
A Case for Peering of Content Delivery Networks
: The proliferation of Content Delivery Networks (CDN) reveals that existing content networks are owned and operated by individual companies. As a consequence, closed delivery netw...
Rajkumar Buyya, Al-Mukaddim Khan Pathan, James Bro...