1016 search results - page 31 / 204 » Optimized algorithms for multi-agent routing |
ICMCS
2005
IEEE
14 years 2 months ago
2005
IEEE
When an ad hoc network with limited link capacities is used to transport high-rate, latency-constrained multimedia streams, it is important that routing algorithms not only yield ...
KES
2000
Springer
14 years 11 days ago
2000
Springer
This paper addresses the problem of selecting route to a given destination on a load map under a dynamic environment. The proposed solution is using a genetic algorithm adopting v...
GECCO
2003
Springer
14 years 2 months ago
2003
Springer
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— Many previously proposed routing metrics and algorithms for ad hoc networks work well in static networks, however, when nodes are moving and wireless links may fail from time t...
WDAG
2005
Springer
14 years 2 months ago
2005
Springer
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...