Sciweavers

3274 search results - page 299 / 655
» Communication strategies in games
Sort
View
OPODIS
2007
15 years 8 months ago
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?
Consider the following game between a worm and an alert3 over a network of n nodes. Initially, no nodes are infected or alerted and each node in the network is a special detector n...
James Aspnes, Navin Rustagi, Jared Saia
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
15 years 6 months ago
The Nonstochastic Multiarmed Bandit Problem
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freun...
IPPS
2005
IEEE
16 years 11 days ago
Packet Routing in Dynamically Changing Networks on Chip
On-line routing strategies for communication in a dynamic network on chip (DyNoC) environment are presented. The DyNoC has been presented as a medium supporting communication amon...
Mateusz Majer, Christophe Bobda, Ali Ahmadinia, J&...
NGC
2000
Springer
109views Communications» more  NGC 2000»
15 years 10 months ago
Router level filtering for receiver interest delivery
Delivering data to on-line game participants requires the game data to be "customized" in real-time to each participant's characteristics. Using multicast in such a...
Manuel M. Oliveira, Jon Crowcroft, Christophe Diot
JSAC
2008
125views more  JSAC 2008»
15 years 6 months ago
Optimal Competitive Algorithms for Opportunistic Spectrum Access
We consider opportunistic spectrum access (OSA) strategies for a transmitter in a multichannel wireless system, where a channel may or may not be available and the transmitter must...
Nicholas B. Chang, Mingyan Liu