Sciweavers

2092 search results - page 102 / 419
» A Theory of Non-Deterministic Networks
Sort
View
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 5 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
P2P
2005
IEEE
137views Communications» more  P2P 2005»
15 years 5 months ago
The Essence of P2P: A Reference Architecture for Overlay Networks
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have r...
Karl Aberer, Luc Onana Alima, Ali Ghodsi, Sarunas ...
CORR
2007
Springer
149views Education» more  CORR 2007»
14 years 11 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 6 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
101
Voted
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 1 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau