866 search results - page 138 / 174 » On Dynamic Shortest Paths Problems |
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
BMCBI
2008
13 years 9 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
IANDC
2008
13 years 9 months ago
2008
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...