Sciweavers

830 search results - page 19 / 166
» Route kernels for trees
Sort
View
DAC
1995
ACM
15 years 3 months ago
New Performance-Driven FPGA Routing Algorithms
—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ļ...
Michael J. Alexander, Gabriel Robins
ICNP
2002
IEEE
15 years 4 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman
CIKM
2005
Springer
15 years 5 months ago
Localized routing trees for query processing in sensor networks
In this paper, we propose a novel energy-efficient approach, a localized routing tree (LRT) coupled with a route redirection (RR) strategy, to support various types of queries. LR...
Jie Lian, Lei Chen 0002, Kshirasagar Naik, M. Tame...
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 5 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
JCM
2006
95views more  JCM 2006»
14 years 11 months ago
A Learning-based Adaptive Routing Tree for Wireless Sensor Networks
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be either static or mobile. Even in static cases, a s...
Ying Zhang, Qingfeng Huang