1054 search results - page 21 / 211 » Capacitated Domination Problem |
132
click to vote
DAC
2006
ACM
2006
ACM
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
15 years 8 months ago
We propose a novel and efficient charge-based decoupling capacitance budgeting algorithm. Our method uses the macromodeling technique and effective radius of decoupling capacitan...
103
click to vote
GLVLSI
1998
IEEE
15 years 6 months ago
1998
IEEE
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
129
Voted
ESA
2001
Springer
15 years 6 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
121
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
119
Voted
CAAN
2006
Springer
15 years 6 months ago
2006
Springer
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...