Sciweavers

352 search results - page 58 / 71
» Establishing norms with metanorms in distributed computation...
Sort
View
PODC
2004
ACM
15 years 3 months ago
Asynchronous group key exchange with failures
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Christian Cachin, Reto Strobl
PODC
2010
ACM
15 years 2 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
AAAI
1994
14 years 11 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
WWW
2008
ACM
15 years 11 months ago
Secure or insure?: a game-theoretic analysis of information security games
Despite general awareness of the importance of keeping one's system secure, and widespread availability of consumer security technologies, actual investment in security remai...
Jens Grossklags, Nicolas Christin, John Chuang
WCNC
2008
IEEE
15 years 4 months ago
Fluid Model of the Outage Probability in Sectored Wireless Networks
— We establish a closed form formula of the other-cell interference factor f for omni-directional and sectored cellular networks, as a function of the location of the mobile. Tha...
Jean Marc Kelif, Marceau Coupechoux, Philippe Godl...