Sciweavers

8728 search results - page 339 / 1746
» On Reduct Construction Algorithms
Sort
View
ISCAPDCS
2007
15 years 8 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
16 years 7 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
ICCNMC
2005
Springer
16 years 8 days ago
Hierarchical Multicast Tree Algorithms for Application Layer Mesh Networks
This paper proposes a set of novel multicast algorithms for m-D mesh overlay networks that can achieve shorter multicast delay and less resource consumptions. In contrast to previo...
Weijia Jia, Wanqing Tu, Jie Wu
167
Voted
IPPS
2002
IEEE
15 years 11 months ago
Fault Recovery for a Distributed SP-Based Delay Constrained Multicast Routing Algorithm
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
Hasan Ural, Keqin Zhu
DNA
2003
Springer
153views Bioinformatics» more  DNA 2003»
15 years 12 months ago
Proofreading Tile Sets: Error Correction for Algorithmic Self-Assembly
Abstract. For robust molecular implementation of tile-based algorithmic self-assembly, methods for reducing errors must be developed. Previous studies suggested that by control of ...
Erik Winfree, Renat Bekbolatov