1054 search results - page 54 / 211 » Capacitated Domination Problem |
110
click to vote
ICCAD
1996
IEEE
15 years 6 months ago
1996
IEEE
In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We de ne a class of optimization problems as CH-posynomial programs and reveal a genera...
124
Voted
DATE
2010
IEEE
15 years 7 months ago
2010
IEEE
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...
133
Voted
DM
2007
15 years 2 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
DM
2008
15 years 2 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
108
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
In this paper a new approach to solve constrained multi-objective problems by way of evolutionary multi-objective optimization is introduced. In contrast to former evolutionary ap...