Sciweavers

473 search results - page 26 / 95
» The Case for Quantum Key Distribution
Sort
View
CORR
1998
Springer
184views Education» more  CORR 1998»
13 years 7 months ago
Case Study in Survivable Network System Analysis
This paper presents a method for analyzing the survivability of distributed network systems and an example of its application. Survivability is the capability of a system to fulfi...
Robert J. Ellison, Richard C. Linger, Thomas A. Lo...
IFIP
2004
Springer
14 years 27 days ago
The Problematic of Distributed Systems Supervision - An Example: Genesys
: This chapter presents the problematic of the distributed systems supervision through a comprehensive state-of-the-art. Issues are illustrated with a case study about an innovativ...
Jean-Eric Bohdanowicz, Stefan Wesner, Lászl...
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
A Multi-agent Framework for Performance Tuning in Distributed Environment
: This paper presents the overall design of a multi-agent framework for improving the performance of an application executing in a distributed environment. The multi-agent framewor...
Sarbani Roy, Saikat Halder, Nandini Mukherjee
CCIA
2009
Springer
13 years 8 months ago
A Cryptographic Solution for Private Distributed Simple Meeting Scheduling
Meeting Scheduling is a suitable application for distributed computation, motivated by its privacy requirements. Previous work on this problem have considered some cryptographic te...
Javier Herranz, Stan Matwin, Pedro Meseguer, Jordi...
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
14 years 1 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen