Sciweavers

245 search results - page 14 / 49
» Parametric probabilistic transition systems for system desig...
Sort
View
DSN
2008
IEEE
14 years 1 months ago
Probabilistic quorum systems in wireless ad hoc networks
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
Roy Friedman, Gabriel Kliot, Chen Avin
MOBIHOC
2003
ACM
14 years 18 days ago
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster
ICSE
2000
IEEE-ACM
13 years 11 months ago
Graphical animation of behavior models
Graphical animation is a way of visualizing the behavior of design models. This visualization is of use in validating a design model against informally specified requirements and ...
Jeff Magee, Nat Pryce, Dimitra Giannakopoulou, Jef...
ACSAC
2004
IEEE
13 years 11 months ago
Designing Good Deceptions in Defense of Information Systems
Since attackers trust computer systems to tell them the truth, it may be effective for those systems to lie or mislead. This could waste the attacker's resources while permit...
Neil C. Rowe
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...