2343 search results - page 195 / 469 » The Locomotive Routing Problem |
148
click to vote
VLSID
2002
IEEE
16 years 6 months ago
2002
IEEE
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...
149
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
174
click to vote
AAIM
2005
Springer
16 years 19 hour ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
163
click to vote
ICN
2001
Springer
15 years 11 months ago
2001
Springer
This paper addresses multicast routing in multi-hop optical networks employing wavelength-division multiplexing (WDM). We consider a model in which multicast communication requests...
158
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...