Sciweavers

2 search results - page 1 / 1
» The Complexity of Reachability in Randomized Sabotage Games
Sort
View
FSEN
2009
Springer
14 years 2 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 27 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust