1578 search results - page 55 / 316 » Direct Routing: Algorithms and Complexity |
INFOCOM
1999
IEEE
14 years 1 months ago
1999
IEEE
Wire-speed IP (Internet Protocol) routers require very fast routing table lookup for incoming IP packets. The routing table lookup operation is time consuming because the part of ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
SIGMETRICS
2004
ACM
14 years 2 months ago
2004
ACM
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of th...
NIPS
2004
13 years 10 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
FCS
2006
13 years 10 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...