Sciweavers

5079 search results - page 159 / 1016
» Hidden-Action in Network Routing
Sort
View
ATMOS
2010
128views Optimization» more  ATMOS 2010»
14 years 9 months ago
Robust Train Routing and Online Re-scheduling
Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign...
Alberto Caprara, Laura Galli, Leo G. Kroon, G&aacu...
104
Voted
INFOCOM
2012
IEEE
13 years 18 days ago
Harnessing Internet topological stability in Thorup-Zwick compact routing
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
Stephen D. Strowes, Colin Perkins
76
Voted
TEC
2002
117views more  TEC 2002»
14 years 9 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
92
Voted
CORR
2010
Springer
186views Education» more  CORR 2010»
14 years 5 months ago
QoS Routing in Smart Grid
Smart grid is an emerging technology which is able to control the power load via price signaling. The communication between the power supplier and power customers is a key issue in...
Husheng Li, Weiyi Zhang
TON
2012
13 years 18 days ago
Independent Directed Acyclic Graphs for Resilient Multipath Routing
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
Sangman Cho, Theodore Elhourani, Srinivasan Ramasu...