2343 search results - page 201 / 469 » The Locomotive Routing Problem |
163
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
176
click to vote
WCNC
2008
IEEE
16 years 26 days ago
2008
IEEE
— A cross-layer algorithm for geographic routing in Wireless Sensor Networks (WSNs) is proposed, which is robust to dead-ends and resilient to topological variations due to netwo...
155
click to vote
FPGA
2007
ACM
16 years 19 days ago
2007
ACM
Chip design in the nanometer regime is becoming increasingly difficult due to process variations. ASIC designers have adopted statistical optimization techniques to mitigate the e...
162
click to vote
STACS
2007
Springer
16 years 18 days ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
262
click to vote
PDCAT
2005
Springer
15 years 12 months ago
2005
Springer
This paper considers the on-line traffic grooming problem in WDM-TDM switched optical mesh networks without wavelength conversion capability. The objective is to efficiently rou...