653 search results - page 50 / 131 » The size of minimum 3-trees |
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
In deep submicron VLSI circuits, interconnect reliability due to electromigration and thermal effects is fast becoming a serious design issue particularly for long signal lines. T...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
112
click to vote
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
105
click to vote
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Effective and efficient management of wireless network resources is attracting more and more research attention, due to the rapid growing deployment of wireless mesh and ad hoc...
DATE
2005
IEEE
15 years 5 months ago
2005
IEEE
The advent of sensor networks presents untapped opportunities for synthesis. We examine the problem of synthesis of behavioral specifications into networks of programmable sensor ...