Sciweavers

1923 search results - page 123 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
COORDINATION
2004
Springer
15 years 3 months ago
CoorSet: A Development Environment for Associatively Coordinated Components
A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented....
Kevin Kane, James C. Browne
JAIR
2011
214views more  JAIR 2011»
14 years 23 days ago
Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintve...
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 10 months ago
Secure Transmission with Multiple Antennas II: The MIMOME Wiretap Channel
The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices a...
Ashish Khisti, Gregory W. Wornell
EUROPAR
2008
Springer
14 years 11 months ago
Mapping Heterogeneous Distributed Applications on Clusters
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
Sylvain Jubertie, Emmanuel Melin, Jér&eacut...
PDP
2006
IEEE
15 years 3 months ago
An O(n) Distributed Deadlock Resolution Algorithm
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of prev...
Manuel Prieto, Jesús E. Villadangos, Federi...