Sciweavers

1165 search results - page 19 / 233
» Effective linear programming based placement methods
Sort
View
MP
2007
142views more  MP 2007»
13 years 8 months ago
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
Jagat Patel, John W. Chinneck
EOR
2007
72views more  EOR 2007»
13 years 8 months ago
Placing a finite size facility with a center objective on a rectangular plane with barriers
This paper addresses the finite size 1-center placement problem on a rectangular plane in the presence of barriers. Barriers are regions in which both facility location and trave...
Avijit Sarkar, Rajan Batta, Rakesh Nagi
TSP
2010
13 years 3 months ago
Two-channel linear phase FIR QMF bank minimax design via global nonconvex optimization programming
In this correspondence, a two-channel linear phase finite impulse response (FIR) quadrature mirror filter (QMF) bank minimax design problem is formulated as a nonconvex optimizati...
Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Lamia ...
TCAD
2008
136views more  TCAD 2008»
13 years 8 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar
RIVF
2008
13 years 9 months ago
Simple but effective methods for combining kernels in computational biology
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...
Hiroaki Tanabe, Tu Bao Ho, Canh Hao Nguyen, Saori ...