Sciweavers

625 search results - page 50 / 125
» Routing in Trees
Sort
View
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
15 years 7 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
ICN
2001
Springer
15 years 2 months ago
Performance Evaluation of PIM-SM Recovery
Abstract. A PIM-SM-built multicast tree must be restructured/recovered when the underlying unicast routing tables change. In this article we describe the PIM-SM recovery mechanisms...
Tarik Cicic, Stein Gjessing, Øivind Kure
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
15 years 3 months ago
Multi-level genetic algorithm (MLGA) for the construction of clock binary tree
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
Guofang Nan, Minqiang Li, Jisong Kou
DCOSS
2005
Springer
15 years 3 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
15 years 4 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer