Sciweavers

270 search results - page 41 / 54
» Constraint relaxation in approximate linear programs
Sort
View
ISPD
2012
ACM
283views Hardware» more  ISPD 2012»
12 years 3 months ago
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, Shih-H...
SIAMSC
2008
113views more  SIAMSC 2008»
13 years 7 months ago
An Efficient and Robust Method for Simulating Two-Phase Gel Dynamics
We develop a computational method for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of tra...
Grady B. Wright, Robert D. Guy, Aaron L. Fogelson
OSN
2007
185views more  OSN 2007»
13 years 6 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
ESA
2003
Springer
98views Algorithms» more  ESA 2003»
14 years 19 days ago
Network Lifetime and Power Assignment in ad hoc Wireless Networks
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsk...
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 2 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz