Sciweavers

40 search results - page 7 / 8
» Optimization of Inductor Circuits via Geometric Programming
Sort
View
EOR
2007
113views more  EOR 2007»
13 years 6 months ago
Duality for location problems with unbounded unit balls
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
Gert Wanka, Radu Ioan Bot, Emese Vargyas
INFOCOM
2011
IEEE
12 years 10 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang
TON
2012
11 years 9 months ago
Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
Yi Shi, Y. Thomas Hou
ICCAD
2006
IEEE
127views Hardware» more  ICCAD 2006»
14 years 3 months ago
Joint design-time and post-silicon minimization of parametric yield loss using adjustable robust optimization
Parametric yield loss due to variability can be effectively reduced by both design-time optimization strategies and by adjusting circuit parameters to the realizations of variable...
Murari Mani, Ashish Kumar Singh, Michael Orshansky
ICCD
2006
IEEE
86views Hardware» more  ICCD 2006»
14 years 3 months ago
Interconnect Matching Design Rule Inferring and Optimization through Correlation Extraction
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...
Rasit Onur Topaloglu, Andrew B. Kahng