319 search results - page 20 / 64 » An Analytical Comparison of Optimization Problem Generation ... |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
72
Voted
EUROGP
2003
Springer
15 years 2 months ago
2003
Springer
Test programs are fragment of code, but, unlike ordinary application programs, they are not intended to solve a problem, nor to calculate a function. Instead, they are supposed to ...
102
click to vote
CPAIOR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
105
click to vote
AIPS
2007
14 years 12 months ago
2007
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...