8825 search results - page 1342 / 1765 » All for one or one for all |
104
click to vote
WDAG
1990
Springer
15 years 5 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
111
click to vote
ANCS
2007
ACM
15 years 5 months ago
2007
ACM
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
114
click to vote
MPC
2010
Springer
15 years 5 months ago
2010
Springer
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
112
click to vote
PKC
2010
Springer
15 years 5 months ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
152
click to vote
CF
2010
ACM
15 years 5 months ago
2010
ACM
Studies have shown much of today’s data centers are over-provisioned and underutilized. Over-provisioning cannot be avoided as these centers must anticipate peak load with burst...