Sciweavers

1016 search results - page 61 / 204
» Optimized algorithms for multi-agent routing
Sort
View
SPDP
1993
IEEE
15 years 1 months ago
Extended Distributed Genetic Algorithm for Channel Routing
In this paper, we propose a new parallel genetic alge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantag...
B. B. Prahlada Rao, R. C. Hansdah
SPAA
1994
ACM
15 years 1 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
INFORMS
2008
55views more  INFORMS 2008»
14 years 9 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith
74
Voted
GLOBECOM
2009
IEEE
15 years 1 months ago
Optimized Protection Schemes for Resilient Interdomain Traffic Distribution
Abstract-- Due to the development of Next Generation Networks, leading to a multiservice transport layer with a multidomain environment, the importance of interconnection issues ke...
Miroslaw Kantor, Piotr Cholda, Andrzej Jajszczyk
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 3 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom