Sciweavers

1923 search results - page 160 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
IWSEC
2007
Springer
15 years 4 months ago
Run-Time Randomization to Mitigate Tampering
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
Bertrand Anckaert, Mariusz H. Jakubowski, Ramarath...
EUROPAR
1999
Springer
15 years 2 months ago
DAOS - Scalable And-Or Parallelism
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
Luís Fernando Castro, Vítor Santos C...
ARTS
1999
Springer
15 years 2 months ago
Specifying Performance Measures for PEPA
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
Graham Clark, Stephen Gilmore, Jane Hillston
GCC
2004
Springer
15 years 3 months ago
Reliable Accounting in Grid Economic Transactions
In the Grid computing model a remote service is provided by a resource owner to a client. The resource owner executes a client job and charges the client for a corresponding fee. I...
Luigi Catuogno, Pompeo Faruolo, Umberto Ferraro Pe...
GECCO
2005
Springer
220views Optimization» more  GECCO 2005»
15 years 3 months ago
Scale invariant pareto optimality: a meta--formalism for characterizing and modeling cooperativity in evolutionary systems
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
Mark Fleischer