Sciweavers

287 search results - page 52 / 58
» A Foundation for Defining Security Requirements in Grid Comp...
Sort
View
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
15 years 1 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
OOPSLA
2010
Springer
14 years 7 months ago
Towards a tool-based development methodology for sense/compute/control applications
This poster presents a design language and a tool suite covering the development life-cycle of a Sense/Compute/Control (SCC) application. This language makes it possible to define...
Damien Cassou, Julien Bruneau, Julien Mercadal, Qu...
POLICY
2007
Springer
15 years 3 months ago
Proteus: A Semantic Context-Aware Adaptive Policy Model
The growing diffusion of portable devices enables users to benefit from anytime and anywhere impromptu collaboration. Appropriate policy models that take into account the dynamici...
Alessandra Toninelli, Rebecca Montanari, Lalana Ka...
95
Voted
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
15 years 1 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 1 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks