Sciweavers

1016 search results - page 40 / 204
» Optimized algorithms for multi-agent routing
Sort
View
INFOCOM
1993
IEEE
15 years 10 months ago
Stability of a Class of Dynamic Routing Protocols (IGRP)
We perform an exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm widely used in the industry, on a simple ring network. The distance metri...
Steven H. Low, Pravin Varaiya
ISPD
1999
ACM
106views Hardware» more  ISPD 1999»
15 years 10 months ago
Timing driven maze routing
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
Sung-Woo Hur, Ashok Jagannathan, John Lillis
SIGCOMM
2006
ACM
15 years 12 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
GLOBECOM
2008
IEEE
16 years 14 days ago
Global Optimal Routing, Scheduling and Power Control for Multi-Hop Wireless Networks with Interference
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
Javad Kazemitabar, Vahid Tabatabaee, Hamid Jafarkh...
SPATIALCOGNITION
2004
Springer
15 years 11 months ago
A Model for Context-Specific Route Directions
Wayfinding, i.e. getting from some origin to a destination, is one of the prime everyday problems humans encounter. It has received a lot of attention in research and many (commerc...
Kai-Florian Richter, Alexander Klippel