989 search results - page 78 / 198 » Pebbling and Proofs of Work |
152
click to vote
FOCS
2008
IEEE
16 years 27 days 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...
148
click to vote
TASE
2008
IEEE
16 years 24 days 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...
164
click to vote
TPHOL
2007
IEEE
16 years 21 days 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]. ...
154
click to vote
GECCO
2007
Springer
16 years 17 days 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...
155
click to vote
DSN
2005
IEEE
16 years 1 days 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...