390 search results - page 67 / 78 » Computing shortest paths for any number of hops |
104
click to vote
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
107
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Trellis codes based on linear congruential recursions have recently been introduced as powerful source codes. For a modest computational complexity they offer excellent rate di...
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
SPATIALCOGNITION
1998
Springer
15 years 3 months ago
1998
Springer
Representations and processes involved in judgments of spatial relations after route learning are investigated. The main objective is to decide which relations are explicitly repre...
DIS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...