2343 search results - page 351 / 469 » The Locomotive Routing Problem |
140
Voted
INFOCOM
1997
IEEE
15 years 9 months ago
1997
IEEE
—This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The ...
148
click to vote
ASPDAC
2007
ACM
15 years 9 months ago
2007
ACM
- 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...
162
click to vote
APWEB
2006
Springer
15 years 8 months ago
2006
Springer
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
193
click to vote
WSC
2008
15 years 7 months ago
2008
The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in ...
135
Voted
DAC
2005
ACM
15 years 6 months ago
2005
ACM
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...