13214 search results - page 100 / 2643 » Pseudorandomness for network algorithms |
153
click to vote
NC
2002
15 years 6 months ago
2002
In this paper, Parallel Evolutionary Algorithms for integer weight neural network training are presented. To this end, each processor is assigned a subpopulation of potential solut...
218
click to vote
OL
2011
15 years 1 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
178
click to vote
PDPTA
2003
15 years 7 months ago
2003
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...
163
click to vote
IMC
2007
ACM
15 years 8 months ago
2007
ACM
Entropy has recently gained considerable significance as an important metric for network measurement. Previous research has shown its utility in clustering traffic and detecting ...
147
click to vote
IEEEHPCS
2010
15 years 4 months ago
2010
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...