Sciweavers

205 search results - page 9 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
119
Voted
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 6 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
FORTE
2010
15 years 2 months ago
Grouping Nodes in Wireless Sensor Networks Using Coalitional Game Theory
Wireless sensor networks are typically ad-hoc networks of resource-constrained nodes; in particular, the nodes are limited in power resources. It can be difficult and costly to rep...
Fatemeh Kazemeyni, Einar Broch Johnsen, Olaf Owe, ...
179
Voted
ICDE
2001
IEEE
143views Database» more  ICDE 2001»
16 years 2 months ago
Exactly-once Semantics in a Replicated Messaging System
A distributed message delivery system can use replication to improve performance and availability. However, without safeguards, replicated messages may be delivered to a mobile de...
Yongqiang Huang, Hector Garcia-Molina
130
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
Random Oracles with(out) Programmability
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Th...
128
Voted
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 7 days ago
Non-atomic Games for Multi-User Systems
Abstract—In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful frame...
Nicolas Bonneau, Mérouane Debbah, Eitan Alt...