1054 search results - page 31 / 211 » Capacitated Domination Problem |
DATE
2010
IEEE
15 years 7 months ago
2010
IEEE
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...
124
click to vote
TCAD
1998
15 years 2 months ago
1998
— 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 ...
183
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
174
click to vote
OL
2011
14 years 9 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
110
click to vote
CODES
2006
IEEE
15 years 8 months ago
2006
IEEE
Lowering down the chip temperature is becoming one of the important design considerations, since temperature adversely and seriously affects many of design qualities, such as reli...