895 search results - page 56 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
112
click to vote
GECCO
2000
Springer
15 years 2 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
SGAI
2004
Springer
15 years 4 months ago
2004
Springer
In Wrapper based feature selection, the more states that are visited during the search phase of the algorithm the greater the likelihood of finding a feature subset that has a high...
WADS
2007
Springer
15 years 5 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
EOR
2007
14 years 11 months ago
2007
Disassembly activities take place in various recovery operations including remanufacturing, recycling and disposal. The disassembly line is the best choice for automated disassemb...
118
click to vote
MST
2010
14 years 5 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...