989 search results - page 78 / 198 » Pebbling and Proofs of Work |
FOCS
2008
IEEE
14 years 2 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...
TASE
2008
IEEE
14 years 2 months ago
2008
IEEE
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
TPHOL
2007
IEEE
14 years 2 months ago
2007
IEEE
We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. ...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
DSN
2005
IEEE
14 years 1 months ago
2005
IEEE
Hardware dependability improvements have led to a situation in which it is sometimes unnecessary to employ extensive hardware replication to mask hardware faults. Expanding upon o...