1016 search results - page 32 / 204 » Optimized algorithms for multi-agent routing |
150
click to vote
ICCNMC
2005
Springer
15 years 11 months ago
2005
Springer
This paper proposes a set of novel multicast algorithms for m-D mesh overlay networks that can achieve shorter multicast delay and less resource consumptions. In contrast to previo...
142
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
142
click to vote
PDCAT
2007
Springer
16 years 3 days ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
177
click to vote
AEI
2004
15 years 5 months ago
2004
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
188
click to vote
ASC
2011
15 years 1 months ago
2011
In this work, a novel optimization framework is proposed that allows the improvement of Quality of Service levels in TCP/IP based networks, by configuring the routing weights of ...