830 search results - page 37 / 166 » Route kernels for trees |
126
click to vote
ICCAD
2008
IEEE
16 years 22 days ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
174
click to vote
JCIT
2008
15 years 3 months ago
2008
Multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication which includes application such as multipoint data dissemination and m...
119
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
142
click to vote
COMCOM
2006
15 years 3 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
134
Voted
TMC
2008
15 years 3 months ago
2008
Content-based routing (CBR) provides a powerful and flexible foundation for distributed applications. Its communication model, based on implicit addressing, fosters decoupling amon...