Sciweavers

5056 search results - page 421 / 1012
» Network Coding Theory
Sort
View
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
15 years 11 months ago
Doing Good with Spam Is Hard
We study economic means to improve network performance in the well-known game theoretic traffic model due to Wardrop. We introduce two sorts of spam flow - auxiliary and adversari...
Martin Hoefer, Lars Olbrich, Alexander Skopalik
PODC
2006
ACM
15 years 10 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
SIGECOM
2003
ACM
134views ECommerce» more  SIGECOM 2003»
15 years 10 months ago
Correlated equilibria in graphical games
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
Sham Kakade, Michael J. Kearns, John Langford, Lui...
138
Voted
TOPLAS
2010
101views more  TOPLAS 2010»
15 years 3 months ago
Nomadic pict: Programming languages, communication infrastructure overlays, and semantics for mobile computation
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
Peter Sewell, Pawel T. Wojciechowski, Asis Unyapot...
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
15 years 2 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...