4480 search results - page 159 / 896 » Prototyping Completion with Constraints Using Computational ... |
148
click to vote
NSDI
2007
15 years 8 months ago
2007
Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...
135
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
A recently published approach to adaptive page rank, using the solution of quadratic optimization methods with a set of simple constraints [3], is modified to permit classificatio...
184
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
158
click to vote
COMPSAC
2000
IEEE
15 years 10 months ago
2000
IEEE
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
179
click to vote
ICAS
2006
IEEE
16 years 13 days ago
2006
IEEE
A modern server system must deliver a complex set of obligations towards its users. We study the concept of roles as autonomous encapsulations of a set of promises. Using virtuali...