Sciweavers

113 search results - page 1 / 23
» Trunk decomposition based global routing optimization
Sort
View
ICCAD
2006
IEEE
304views Hardware» more  ICCAD 2006»
14 years 1 months ago
Trunk decomposition based global routing optimization
We present global routing optimization methods which are not based on rip-up and re-route framework. In particular, the routing optimization is based on trunk decomposition [13] o...
Devang Jariwala, John Lillis
ICC
2007
IEEE
13 years 11 months ago
Inter-Domain QoS Routing with Virtual Trunks
— This paper addresses the problem of inter-domain QoS routing. We propose a solution based on virtual-trunk type aggregates corresponding to Service Level Agreements (SLA) for d...
Rui Prior, Susana Sargento
MOC
2002
101views more  MOC 2002»
13 years 4 months ago
Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
Xue-Cheng Tai, Jinchao Xu
CP
2010
Springer
13 years 3 months ago
Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
Russell Bent, Pascal Van Hentenryck
ICC
2009
IEEE
190views Communications» more  ICC 2009»
13 years 11 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...