5964 search results - page 272 / 1193 » A theory of speculative computation |
177
click to vote
BIRTHDAY
2004
Springer
16 years 20 days ago
2004
Springer
A long-standing complaint about the theory of CSP has been that all theories which encompass divergence are divergence-strict, meaning that nothing beyond the first divergence ca...
184
click to vote
BIRTHDAY
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
165
click to vote
CIE
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
177
click to vote
ASPLOS
2010
ACM
16 years 1 months ago
2010
ACM
As the number of devices available per chip continues to increase, the computational potential of future computer architectures grows likewise. While this is a clear benefit for f...
188
click to vote
SIGECOM
2005
ACM
16 years 25 days ago
2005
ACM
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...