Sciweavers

231 search results - page 21 / 47
» Path disruption games
Sort
View
RTAS
1997
IEEE
15 years 1 months ago
OS-Controlled Cache Predictability for Real-Time Systems
3rd IEEE Real-time Technology and Applications Symposium (RTAS), June 1997 in Montreal, Canada Cache-partitioning techniques have been invented to make modern processors with an e...
Jochen Liedtke, Hermann Härtig, Michael Hohmu...
JSAC
2008
121views more  JSAC 2008»
14 years 9 months ago
Stochastic analysis of network coding in epidemic routing
Epidemic routing has been proposed to reduce the data transmission delay in disruption tolerant wireless networks, in which data can be replicated along multiple opportunistic path...
Yunfeng Lin, Baochun Li, Ben Liang
83
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
Sensor-Centric Quality of Routing in Sensor Networks
Abstract— Standard embeded sensor nework models emphasize energy efficiency and distributed decision-making by considering untethered and unattended sensors. To this we add two ...
Rajgopal Kannan, Sudipta Sarangi, S. Sitharama Iye...
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CORR
2010
Springer
104views Education» more  CORR 2010»
14 years 9 months ago
A new proof of Nash's Theorem via exchangeable equilibria
We give a novel proof of the existence of Nash equilibria in all finite games without using fixed point theorems or path following arguments. Our approach relies on a new notion i...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...