Sciweavers

115 search results - page 6 / 23
» The Computational Complexity of Monotonicity in Probabilisti...
Sort
View
IPL
2011
91views more  IPL 2011»
12 years 10 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
JCB
2006
185views more  JCB 2006»
13 years 6 months ago
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
ACSAC
2003
IEEE
14 years 1 days ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
GLOBECOM
2006
IEEE
14 years 24 days ago
On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Mahalingam Ramkumar
CCGRID
2008
IEEE
13 years 8 months ago
A Probabilistic Model to Analyse Workflow Performance on Production Grids
Production grids are complex and highly variable systems whose behavior is not well understood and difficult to anticipate. The goal of this study is to estimate the impact of the ...
Tristan Glatard, Johan Montagnat, Xavier Pennec