We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
We review recent work on the Hierarchical-If-And-Only-If problem and present a new hierarchical problem, HIFF-M that does not fit with previous explanations for evolutionary diffi...
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
This paper describes a novel application of text categorization for mathematical word problems, namely Multiplicative Compare and Equal Group problems. The empirical results and a...
Suleyman Cetintas, Luo Si, Yan Ping Xin, Dake Zhan...