Sciweavers

1923 search results - page 266 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
EUROPAR
2010
Springer
14 years 11 months ago
cTrust: Trust Aggregation in Cyclic Mobile Ad Hoc Networks
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
Huanyu Zhao, Xin Yang, Xiaolin Li
FSS
2002
84views more  FSS 2002»
14 years 9 months ago
A possibilistic approach to selecting portfolios with highest utility score
The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this ...
Christer Carlsson, Robert Fullér, Pé...
EUROPAR
2006
Springer
15 years 1 months ago
A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
Hyungsoo Jung, Heon Young Yeom
DRM
2003
Springer
15 years 3 months ago
Experiences with the enforcement of access rights extracted from ODRL-based digital contracts
In this paper, we present our experiences concerning the enforcement of access rights extracted from ODRL-based digital contracts. We introduce the generalized Contract Schema (Co...
Susanne Guth, Gustaf Neumann, Mark Strembeck
CSREAEEE
2006
148views Business» more  CSREAEEE 2006»
14 years 11 months ago
Realising RosettaNet PIP Compositions as Web Service Orchestrations - A Case Study
A world of ever growing competition not only forces enterprises to continuously optimise their private business processes but also to integrate their business processes with their ...
Andreas Schönberger, Guido Wirtz