383 search results - page 12 / 77 » A new infeasible interior-point algorithm for linear program... |
131
click to vote
ASPDAC
1999
ACM
15 years 8 months ago
1999
ACM
Certain manufacturing steps in very deep submicron VLSI involve chemical-mechanical polishing CMP which has varying e ects on device and interconnect features, depending on loca...
134
click to vote
EUROGP
2003
Springer
15 years 9 months ago
2003
Springer
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar struc...
132
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
131
click to vote
ICCD
2004
IEEE
2004
IEEE
Circuit-Based Preprocessing of ILP and Its Applications in Leakage Minimization and Power Estimation
16 years 23 days ago
In this paper we discuss the application of circuit-based logical reasoning to simplify optimization problems expressed as integer linear programs (ILP) over circuit states. We de...
136
click to vote
DAC
1997
ACM
15 years 8 months ago
1997
ACM
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...