625 search results - page 6 / 125 » Semi-preemptive routing on trees |
ADHOCNOW
2007
Springer
14 years 1 months ago
2007
Springer
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
ADHOCNOW
2005
Springer
14 years 27 days ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
EOR
2000
13 years 7 months ago
2000
In the capacitated arc routing problem with multiple centers (M-CARP) the objective is to
PADS
2003
ACM
14 years 18 days ago
2003
ACM
In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted....
DAC
1995
ACM
13 years 11 months ago
1995
ACM
—Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions signi...