Sciweavers

113 search results - page 5 / 23
» Trunk decomposition based global routing optimization
Sort
View
CPAIOR
2005
Springer
14 years 3 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 3 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
TON
2010
125views more  TON 2010»
13 years 4 months ago
S4: Small State and Small Stretch Compact Routing Protocol for Large Static Wireless Networks
Routing protocols for large wireless networks must address the challenges of reliable packet delivery at increasingly large scales and with highly limited resources. Attempts to re...
Y. Mao, F. Wang, L. Qiu, S. Lam, J. Smith
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
14 years 1 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
CVPR
2008
IEEE
14 years 11 months ago
Spectrally optimal factorization of incomplete matrices
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...
Pedro M. Q. Aguiar, João M. F. Xavier, Mark...