571 search results - page 7 / 115 » Impact of the Optimum Routing and |
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...
ISPD
1999
ACM
13 years 12 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
SIROCCO
1998
13 years 9 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
NETCOOP
2007
Springer
14 years 1 months ago
2007
Springer
Recently Gerald Ash has shown through case studies that event dependent routing is attractive in large scale multi-service MPLS networks. In this paper, we consider the application...
ICDCS
2009
IEEE
14 years 4 months ago
2009
IEEE
Autonomous routing algorithms, such as BGP, are intended to reach a globally consistent set of routes after nodes iteratively and independently collect, process, and share network...