151 search results - page 24 / 31 » The Computational Complexity of Knot and Link Problems |
DIALM
2005
ACM
13 years 9 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
IAT
2005
IEEE
14 years 29 days ago
2005
IEEE
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
CA
1999
IEEE
13 years 11 months ago
1999
IEEE
The continuously increasing complexity of computer animationsmakes it necessary to rely on the knowledge of various experts to cover the different areas of computer graphics and a...
IPSN
2011
Springer
12 years 10 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
CCR
2002
13 years 7 months ago
2002
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...