Sciweavers

552 search results - page 100 / 111
» Constrained Shortest Path Computation
Sort
View
ATAL
2006
Springer
15 years 1 months ago
Distributed navigation in an unknown physical environment
We address the problem of navigating from an initial node to a goal node by a group of agents in an unknown physical environment. In such environments mobile agents must physicall...
Arnon Gilboa, Amnon Meisels, Ariel Felner
VLDB
2004
ACM
187views Database» more  VLDB 2004»
15 years 2 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi
PODC
2003
ACM
15 years 2 months ago
Scaling properties of the Internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
FOCS
1997
IEEE
15 years 1 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
BROADNETS
2007
IEEE
15 years 4 months ago
Resource dimensioning in WDM networks under state-based routing schemes
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta