1578 search results - page 16 / 316 » Direct Routing: Algorithms and Complexity |
INFOCOM
1995
IEEE
14 years 4 days ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
MOBIHOC
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
AAAI
2006
13 years 10 months ago
2006
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
DAM
2006
13 years 8 months ago
2006
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
MOBIHOC
2000
ACM
14 years 29 days ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....