Sciweavers

854 search results - page 84 / 171
» A General Vehicle Routing Problem
Sort
View
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
14 years 2 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 2 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 6 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
ASPDAC
1998
ACM
79views Hardware» more  ASPDAC 1998»
14 years 1 months ago
Simultaneous Wire Sizing and Wire Spacing in Post-Layout Performance Optimization
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
Jiang-An He, Hideaki Kobayashi
CCS
2007
ACM
14 years 3 months ago
Preserving privacy in gps traces via uncertainty-aware path cloaking
Motivated by a probe-vehicle based automotive traffic monitoring system, this paper considers the problem of guaranteed anonymity in a dataset of location traces while maintainin...
Baik Hoh, Marco Gruteser, Hui Xiong, Ansaf Alrabad...