Sciweavers

2652 search results - page 365 / 531
» Privacy-preserving linear programming
Sort
View
80
Voted
TCAD
2008
106views more  TCAD 2008»
14 years 10 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
86
Voted
TMC
2008
104views more  TMC 2008»
14 years 10 months ago
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....
88
Voted
TCAD
1998
107views more  TCAD 1998»
14 years 10 months ago
Optimizing dominant time constant in RC circuits
— Conventional methods for optimal sizing of wires and transistors use linear resistor-capacitor (RC) circuit models and the Elmore delay as a measure of signal delay. If the RC ...
Lieven Vandenberghe, Stephen P. Boyd, Abbas A. El ...
SIAMJO
2002
77views more  SIAMJO 2002»
14 years 10 months ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright
TOPLAS
2002
89views more  TOPLAS 2002»
14 years 10 months ago
Efficient and precise array access analysis
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
Yunheung Paek, Jay Hoeflinger, David A. Padua