Sciweavers

2025 search results - page 383 / 405
» Theory as Game: Designing the Game Game
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 9 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
MOBIHOC
2007
ACM
14 years 8 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 6 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
SOSP
2005
ACM
14 years 5 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
TACAS
2010
Springer
145views Algorithms» more  TACAS 2010»
14 years 3 months ago
Rational Synthesis
Abstract. Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems oft...
Dana Fisman, Orna Kupferman, Yoad Lustig