3428 search results - page 22 / 686 » Making the Case |
139
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
122
Voted
ASPLOS
2004
ACM
15 years 9 months ago
2004
ACM
This paper explores a new technique called coherence decoupling, which breaks a traditional cache coherence protocol into two protocols: a Speculative Cache Lookup (SCL) protocol ...
156
Voted
HOTOS
2007
IEEE
15 years 8 months ago
2007
IEEE
Program comments have long been used as a common practice for improving inter-programmer communication and code readability, by explicitly specifying programmers' intentions ...
138
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
203
click to vote
ECRTS
2010
IEEE
15 years 5 months ago
2010
IEEE
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...