Sciweavers

127 search results - page 2 / 26
» Mode Directed Path Finding
Sort
View
NETWORKING
2004
13 years 7 months ago
A Geometric Derivation of the Probability of Finding a Relay in Multi-rate Networks
Abstract. Relaying can improve performance of a wireless network, especially when different transmission modes with distance/cost tradeoffs are available. Examples of such modes in...
Laura Marie Feeney, Daniel Hollos, Martin Kubisch,...
ECMDAFA
2006
Springer
136views Hardware» more  ECMDAFA 2006»
13 years 9 months ago
Finding a Path to Model Consistency
A core problem in Model Driven Engineering is model consistency achievement: all models must satisfy relationships constraining them. Active consistency techniques monitor and cont...
Gregory de Fombelle, Xavier Blanc, Laurent Rioux, ...
COMPGEOM
2010
ACM
13 years 10 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
INFOCOM
1991
IEEE
13 years 9 months ago
On Multicast Path Finding Algorithms
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
Ching-Hua Chow
GISCIENCE
2008
Springer
141views GIS» more  GISCIENCE 2008»
13 years 6 months ago
Simplest Instructions: Finding Easy-to-Describe Routes for Navigation
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...
Kai-Florian Richter, Matt Duckham