5079 search results - page 397 / 1016 » Hidden-Action in Network Routing |
192
Voted
PDCAT
2007
Springer
16 years 1 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
191
Voted
ICPPW
2002
IEEE
16 years 19 days ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
205
Voted
FLAIRS
2004
15 years 9 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
213
Voted
ESA
2010
Springer
15 years 8 months ago
2010
Springer
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
211
Voted
ICC
2008
IEEE
16 years 2 months ago
2008
IEEE
Abstract— Wireless Mesh Network (WMN) has been recognized as one of the promising technologies to provide wireless broadband access. In addition to the multi-radio multi-channel ...