This document collects together reports of the sessions from the 2010 ACM SIGCOMM Conference, the annual conference of the ACM Special Interest Group on Data Communication (SIGCOM...
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
This paper offers practical design-guidelines for developing efficient genetic algorithms (GAs) to successfully solve realworld problems. As an important design component, a prac...
Chang Wook Ahn, Sanghoun Oh, Rudrapatna S. Ramakri...
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...