Sciweavers

866 search results - page 34 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
PERCOM
2004
ACM
16 years 5 months ago
Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
Regina Bischoff, Roger Wattenhofer
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
15 years 11 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
MOBIHOC
2003
ACM
16 years 5 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
CIA
2007
Springer
16 years 11 days ago
From Local Search to Global Behavior: Ad Hoc Network Example
We introduce the Consensual N-Player Prisoner’s Dilemma as a large-scale dilemma. We then present a framework for cooperative consensus formation in large-scale MAS under the N-P...
Osher Yadgar
CIKM
2009
Springer
16 years 23 days ago
An analysis of information diffusion in the blog world
In the blog world, bloggers produce information, establish relationships with other bloggers in order to exchange information, and form a blog network, an online social network. I...
Yong-Suk Kwon, Sang-Wook Kim, Sunju Park