1923 search results - page 291 / 385 » Modeling Complexity in Secure Distributed Computing |
IPPS
1994
IEEE
15 years 1 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
ISVD
2010
IEEE
14 years 8 months ago
2010
IEEE
—We study the topology of the Megaparsec Cosmic Web on the basis of the Alpha Shapes of the galaxy distribution. The simplicial complexes of the alpha shapes are used to determin...
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
The actor model has already proven itself as an interesting concurrency model that avoids issues such as deadlocks and race conditions by construction, and thus facilitates concur...
110
click to vote
IWAN
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents the main concepts of the IST Project FAIN "Future Active IP Networks" [10], a three-year collaborative research project, whose main task is to develo...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer’s ide...