400 search results - page 17 / 80 » Hard Problem Generation for MKP |
COCO
2004
Springer
14 years 4 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
SMI
2007
IEEE
14 years 5 months ago
2007
IEEE
In order to compute texture atlases with low stretch and hardly visible texture seams existing texture mapping tools pose high demands on the quality of surface representations li...
EOR
2010
13 years 11 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
IJCAI
2001
14 years 7 days ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
GECCO
2008
Springer
13 years 12 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...