830 search results - page 38 / 166 » Route kernels for trees |
136
click to vote
SCHEDULING
2008
15 years 3 months ago
2008
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
120
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
—We propose a framework for the creation and maintenance of multicast trees in hierarchical ATM networks. This framework aims at coping with an inherent difficulty of topology a...
151
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
137
click to vote
DAM
2008
15 years 3 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
125
Voted
ISPD
2006
ACM
15 years 9 months ago
2006
ACM
Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufactu...