Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
Abstract— A fundamental paradigm in peer-to-peer (P2P) content distribution is that of a large community of intermittentlyconnected nodes that cooperate to share files. Because ...
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...