2168 search results - page 353 / 434 » Randomized Algorithms and Complexity Theory |
105
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
108
click to vote
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...
128
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
120
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
141
click to vote
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
We consider the issue of representing coalitional games in multiagent systems with externalities (i.e., in systems where the performance of one coalition may be affected by other ...