1578 search results - page 38 / 316 » Direct Routing: Algorithms and Complexity |
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
ADHOCNOW
2008
Springer
14 years 3 months ago
2008
Springer
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
ICNP
2009
IEEE
14 years 3 months ago
2009
IEEE
—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...
AI
2005
Springer
13 years 8 months ago
2005
Springer
We present a formal model for qualitative spatial reasoning with cardinal directions utilizing a co-ordinate system. Then, we study the problem of checking the consistency of a se...