Sciweavers

256 search results - page 36 / 52
» Reusing Static Keys in Key Agreement Protocols
Sort
View
SCP
2010
155views more  SCP 2010»
13 years 7 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
ATAL
2009
Springer
14 years 3 months ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...
WIMOB
2007
IEEE
14 years 3 months ago
A New Protocol for Securing Wireless Sensor Networks against Nodes Replication Attacks
—The low-cost, unattended nature and the capability of self-organizing of sensors, yield the use of Wireless Sensor Networks (WSN) very popular to day. Unfortunately, the unshiel...
Chakib Bekara, Maryline Laurent-Maknavicius
SIGGRAPH
1996
ACM
14 years 1 months ago
Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments
We present a new method that utilizes path coherence to accelerate walkthroughs of geometrically complex static scenes. As a preprocessing step, our method constructs a BSP-tree t...
Jonathan Shade, Dani Lischinski, David Salesin, To...
DC
1999
13 years 8 months ago
A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
Michel Hurfin, Michel Raynal