36 search results - page 7 / 8 » On the Hardness of Approximating the Network Coding Capacity |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
SIGMETRICS
2003
ACM
15 years 2 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
153
click to vote
VLDB
2008
ACM
15 years 9 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
101
click to vote
CCS
2005
ACM
15 years 2 months ago
2005
ACM
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...