188 search results - page 22 / 38 » Evolutionary Algorithms for Vertex Cover |
104
click to vote
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
109
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
101
click to vote
EUROCAST
2007
Springer
15 years 3 months ago
2007
Springer
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
148
click to vote
APPROX
2006
Springer
15 years 3 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...