17760 search results - page 310 / 3552 » A Generalization of the Massey-Ding Algorithm |
172
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper describes initial testing of a novel idea to combine a CGP with an EDA. In recent work a new improved crossover technique was successfully applied to a CGP. To implemen...
205
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract—We point out a problem inherent in the optimization scheme of many popular feature selection methods. It follows from the implicit assumption that higher feature selecti...
202
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
172
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
110
click to vote
IJIS
2008
15 years 6 months ago
2008
Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computati...