Sciweavers

1117 search results - page 189 / 224
» Equivalent Representations of Set Functions
Sort
View
SRDS
2006
IEEE
15 years 4 months ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring
CASES
2004
ACM
15 years 3 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
SAG
2004
Springer
15 years 3 months ago
A Framework for the Design and Reuse of Grid Workflows
Grid workflows can be seen as special scientific workflows involving high performance and/or high throughput computational tasks. Much work in grid workflows has focused on improvi...
Ilkay Altintas, Adam Birnbaum, Kim Baldridge, Wibk...
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 1 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
TYPES
2000
Springer
15 years 1 months ago
A Tour with Constructive Real Numbers
Abstract. The aim of this work is to characterize constructive real numbers through a minimal axiomatization. We introduce, discuss and justify 16 constructive axioms. Then we addr...
Alberto Ciaffaglione, Pietro Di Gianantonio