3319 search results - page 313 / 664 » Type Theoretical Databases |
136
Voted
RANDOM
1997
Springer
15 years 7 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
104
Voted
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
115
click to vote
FOCS
1994
IEEE
15 years 7 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
90
Voted
ACMSE
2007
ACM
15 years 7 months ago
2007
ACM
Many strategies have been proposed to address the problems associated with managing increasingly complex computing systems. IBM's Autonomic Computing (AC) paradigm is one suc...
117
Voted
CSE
2009
IEEE
15 years 7 months ago
2009
IEEE
This paper contributes to the evolving body of knowledge pertaining to the study of digitally-enabled social networks, their usage, and their effects on people, organization, and s...