Sciweavers

2882 search results - page 198 / 577
» Enhancements to the Voting Algorithm
Sort
View
CCR
2008
94views more  CCR 2008»
15 years 4 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
COMCOM
2008
100views more  COMCOM 2008»
15 years 4 months ago
Multicast algorithms in service overlay networks
Overlay routing has been proposed to enhance the reliability and performance of IP networks, since it can bypass congestion and transient outages by forwarding traffic through one ...
Dario Pompili, Caterina M. Scoglio, Luca Lopez
TON
2002
138views more  TON 2002»
15 years 4 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
EVOW
2009
Springer
15 years 11 months ago
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
CCGRID
2009
IEEE
15 years 11 months ago
Self-Chord: A Bio-inspired Algorithm for Structured P2P Systems
This paper presents “Self-Chord”, a bio-inspired P2P algorithm that can be profitably adopted to build the information service of distributed systems, in particular Computati...
Agostino Forestiero, Carlo Mastroianni, Michela Me...