Sciweavers

830 search results - page 94 / 166
» Route kernels for trees
Sort
View
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
15 years 3 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
IJIPT
2008
81views more  IJIPT 2008»
14 years 12 months ago
Towards seamless source mobility in SSM: design and evaluation of the Tree Morphing protocol
: Multimedia networking in the near future is expected to be dominated by group applications such as IPTV, MMORPGs, and video conferencing. Hand in hand with new service offers, th...
Olaf Christ, Thomas C. Schmidt, Matthias Wähl...
PERCOM
2008
ACM
15 years 11 months ago
Topology Formation in IEEE 802.15.4: Cluster-Tree Characterization
The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through ...
Francesca Cuomo, Sara Della Luna, Petia Todorova, ...
MDM
2009
Springer
149views Communications» more  MDM 2009»
15 years 6 months ago
ETC: Energy-Driven Tree Construction in Wireless Sensor Networks
Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying...
Panayiotis Andreou, A. Pamboris, Demetrios Zeinali...
SKG
2006
IEEE
15 years 5 months ago
Hierarchical Multicast Tree Algorithms of Data Grid
Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multicast algorithms...
Weijia Jia, Qingfeng Fan, Qiongli Wu, Yanxiang He