895 search results - page 85 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
CPAIOR
2009
Springer
15 years 5 months ago
2009
Springer
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...
72
Voted
VMCAI
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This paper addresses the problem of recovering variable-like entities when analyzing executables in the absence of debugging information. We show that variable-like entit...
FCT
2003
Springer
15 years 4 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
IEAAIE
2005
Springer
15 years 4 months ago
2005
Springer
The preservation of common components has been recently isolated as a beneficial feature of genetic algorithms. One interpretation of this benefit is that the preservation of commo...
101
click to vote
CIAC
2010
Springer
15 years 8 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...