Sciweavers

107 search results - page 10 / 22
» When Random Play is Optimal Against an Adversary
Sort
View
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 9 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 4 months ago
AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming
Abstract--Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often ...
Andréa W. Richa, Christian Scheideler, Stef...
INFOCOM
2011
IEEE
12 years 11 months ago
Privacy analysis of user association logs in a large-scale wireless LAN
User association logs collected from a large-scale wireless LAN record where and when a user has used the network. Such information plays an important role in wireless network res...
Keren Tan, Guanhua Yan, Jihwang Yeo, David Kotz
ATAL
2008
Springer
13 years 9 months ago
MB-AIM-FSI: a model based framework for exploiting gradient ascent multiagent learners in strategic interactions
Future agent applications will increasingly represent human users autonomously or semi-autonomously in strategic interactions with similar entities. Hence, there is a growing need...
Doran Chakraborty, Sandip Sen
IPTPS
2003
Springer
14 years 20 days ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder