Sciweavers

830 search results - page 95 / 166
» Route kernels for trees
Sort
View
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 4 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
IROS
2009
IEEE
120views Robotics» more  IROS 2009»
15 years 6 months ago
Concurrent tree traversals for improved mission performance under limited communication range
— In previous work we presented a multi-robot strategy for routing missions in large scenarios where network connectivity must be explicitly preserved. This strategy is founded o...
Alejandro R. Mosteo, Luis Montano
APCHI
2008
IEEE
15 years 6 months ago
On Generating Backbone Trees through Robust Multi-hop Clusters in Wireless Sensor Networks
Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless...
Inyoung Shin, Moonseong Kim, Hyunseung Choo
DATE
2006
IEEE
87views Hardware» more  DATE 2006»
15 years 6 months ago
Thermal resilient bounded-skew clock tree optimization methodology
The existence of non-uniform thermal gradients on the substrate in high performance IC’s can significantly impact the performance of global on-chip interconnects. This issue is...
Ashutosh Chakraborty, Prassanna Sithambaram, Karth...
EOR
2010
102views more  EOR 2010»
14 years 12 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...