4328 search results - page 482 / 866 » A New Kind of Science |
203
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we solve an open problem posed in our previous work on asynchronous subtyping [12], extending the method to higher-order session communication and functions. Our syst...
165
click to vote
ACMSE
2009
ACM
16 years 1 months ago
2009
ACM
Computer networks have grown considerably over the past decade. Faster and cheaper Internet connections have brought millions of PCs into a domain where rich content and fast down...
168
click to vote
ACSC
2008
IEEE
16 years 1 months ago
2008
IEEE
In the future, if we are to continue to expect improved application performance we will have to achieve it by exploiting course-grained hardware parallelism rather then simply rel...
163
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
159
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...