Sciweavers

2092 search results - page 146 / 419
» A Theory of Non-Deterministic Networks
Sort
View
PODC
2009
ACM
16 years 9 days ago
On a selfish caching game
In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast t...
Pietro Michiardi, Carla-Fabiana Chiasserini, Claud...
106
Voted
PODC
2010
ACM
15 years 3 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...
101
Voted
NETWORKING
2007
15 years 1 months ago
Graph Based Modeling of P2P Streaming Systems
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
EDBT
2011
ACM
197views Database» more  EDBT 2011»
14 years 3 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
ATAL
2011
Springer
13 years 11 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...