Sciweavers

2518 search results - page 296 / 504
» Using Communication Objects During Requirements Analysis
Sort
View
DSN
2007
IEEE
16 years 28 days ago
How to Choose a Timing Model?
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
GROUP
1997
ACM
15 years 10 months ago
Flexible support for business processes: extending cooperative hypermedia with process support
In this paper, we present a cooperativehypermediabased process support system aimed on exible business processes. An analysis of the communication, coordination and cooperation r...
Jörg M. Haake, Weigang Wang
NETWORKING
2004
15 years 8 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
Li Zhou, Chinya V. Ravishankar
ITSSA
2006
90views more  ITSSA 2006»
15 years 6 months ago
The UbiMedic Framework to Support Medical Emergencies by Ubiquitous Computing
: This paper investigates the feasibility of employing the Software Agent technology in the highly dynamic and variable context of healthcare emergency coordination and decision-su...
Francesco De Mola, Giacomo Cabri, Nicola Muratori,...
TPDS
2008
76views more  TPDS 2008»
15 years 6 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer