895 search results - page 34 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
SIGCSE
1997
ACM
15 years 2 months ago
1997
ACM
Algorithm animation has been applied to a huge variety of algorithms, and has been found to be of enormous benefit in assisting with their comprehension. However, the radical natu...
141
click to vote
APPROX
2006
Springer
15 years 2 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...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
STACS
2010
Springer
15 years 5 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...