Sciweavers

1923 search results - page 107 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ICPADS
1996
IEEE
15 years 2 months ago
Transactional programming for distributed agent systems
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
V. K. Murthy
EDCC
1994
Springer
15 years 1 months ago
Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: An Object-Oriented Approach
Security and reliability issues in distributed systems have been investigated for several years at LAAS using a technique called Fragmentation-Redundancy-Scattering (FRS). The aim ...
Jean-Charles Fabre, Yves Deswarte, Brian Randell
ACSAC
2010
IEEE
14 years 7 months ago
Quantifying information leaks in software
Leakage of confidential information represents a serious security risk. Despite a number of novel, theoretical advances, it has been unclear if and how quantitative approaches to ...
Jonathan Heusser, Pasquale Malacaria
GCC
2003
Springer
15 years 3 months ago
An OGSA-Based Quality of Service Framework
Grid computing provides a robust paradigm to aggregate disparate resources in a secure and controlled environment. Grid architectures require an underpinning Quality of Service (Qo...
Rashid J. Al-Ali, Kaizar Amin, Gregor von Laszewsk...
CCR
2006
122views more  CCR 2006»
14 years 10 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer