4940 search results - page 791 / 988 » On the Complexity of Universal Programs |
162
click to vote
CHI
2005
ACM
16 years 6 months ago
2005
ACM
Users of traditional tutorials and help systems often have difficulty finding the components described or pictured in the procedural instructions. Users also unintentionally miss ...
149
click to vote
HPCA
2006
IEEE
16 years 6 months ago
2006
IEEE
Building processors with large instruction windows has been proposed as a mechanism for overcoming the memory wall, but finding a feasible and implementable design has been an elu...
190
click to vote
HPCA
2003
IEEE
16 years 6 months ago
2003
IEEE
We consider the impact of different communication architectures on the performability (performance + availability) of cluster-based servers. In particular, we use a combination of ...
163
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
172
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...