526 search results - page 24 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
73
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-s...
IOR
2010
14 years 7 months ago
2010
The paper considers a stylized model of a dynamic assortment optimization problem, where given a limited capacity constraint, we must decide the assortment of products to offer to...
ICMLA
2009
14 years 7 months ago
2009
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
ITC
1997
IEEE
15 years 1 months ago
1997
IEEE
As the sizes of general and special purpose processors increase rapidly, generating high quality manufacturing tests for them is becoming a serious problem in industry. This paper...
AAAI
2008
14 years 12 months ago
2008
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...