199 search results - page 18 / 40 » Randomised Individual Communication Complexity |
IMC
2010
ACM
13 years 5 months ago
2010
ACM
This paper presents a new approach to determine the geographical footprint of individual Autonomous Systems that directly provide service to end-users, i.e.,eyeball ASes. The key ...
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
Selection cooperation is proposed for rateless coded relaying by developing a novel low-complexity protocol that exploits all source-destination, source-relay, and relay-destinatio...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
ARCS
2004
Springer
14 years 27 days ago
2004
Springer
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...