Sciweavers

224 search results - page 30 / 45
» A parallel repetition theorem
Sort
View
CONCUR
2006
Springer
13 years 11 months ago
A Complete Axiomatic Semantics for the CSP Stable-Failures Model
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
Yoshinao Isobe, Markus Roggenbach
IPCO
2007
114views Optimization» more  IPCO 2007»
13 years 9 months ago
Distinct Triangle Areas in a Planar Point Set
Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
Adrian Dumitrescu, Csaba D. Tóth
CONCUR
2010
Springer
13 years 8 months ago
Kleene, Rabin, and Scott Are Available
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger ...
AAAI
1993
13 years 9 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
HPCA
2003
IEEE
14 years 8 months ago
TCP: Tag Correlating Prefetchers
Although caches for decades have been the backbone of the memory system, the speed gap between CPU and main memory suggests their augmentation with prefetching mechanisms. Recentl...
Zhigang Hu, Margaret Martonosi, Stefanos Kaxiras