279 search results - page 11 / 56 » Reduction approaches for robust shortest path problems |
PRL
2006
14 years 9 months ago
2006
This paper describes an ant colony optimization approach adopted to decide on road-borders to automatically guide a vehicle developed for the DARPA Grand Challenge 2004, available...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
ICCCN
2007
IEEE
15 years 4 months ago
2007
IEEE
—In this paper, we show that minimizing the product of path lengths results in minimizing the probability of connection failure between a source and destination given two links h...
GECCO
2009
Springer
14 years 7 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
MFCS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...