410 search results - page 65 / 82 » Upgrading Shortest Paths in Networks |
97
Voted
BMCBI
2007
14 years 12 months ago
2007
Background: A number of studies on biological networks have been carried out to unravel the topological characteristics that can explain the functional importance of network nodes...
ALGOSENSORS
2008
Springer
15 years 1 months ago
2008
Springer
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
NETWORKING
2004
15 years 1 months ago
2004
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
126
click to vote
HICSS
2006
IEEE
15 years 5 months ago
2006
IEEE
Quick and efficient response to emergency is important for every city. This depends on the quality of the dispatch of emergency service to the scene and back to hospital or other ...