Partial structure learning by subset walsh transform
暂无分享,去创建一个
[1] Kalyanmoy Deb,et al. Analyzing Deception in Trap Functions , 1992, FOGA.
[2] Kyomin Jung,et al. Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions , 2008, COLT.
[3] J. Sylvester. LX. Thoughts on inverse orthogonal matrices, simultaneous signsuccessions, and tessellated pavements in two or more colours, with applications to Newton's rule, ornamental tile-work, and the theory of numbers , 1867 .
[4] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[5] Matthew J. Streeter. Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions , 2004, GECCO.
[6] John McCall,et al. Estimating the distribution in an EDA , 2005 .
[7] David E. Goldberg,et al. Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..
[8] Alden H. Wright,et al. On the convergence of an estimation of distribution algorithm based on linkage discovery and factorization , 2005, GECCO '05.
[9] Martin Pelikan,et al. Bayesian Optimization Algorithm , 2005 .
[10] Rich Caruana,et al. Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.
[11] Gilbert Owusu,et al. A fully multivariate DEUM algorithm , 2009, 2009 IEEE Congress on Evolutionary Computation.
[12] Alden H. Wright,et al. Efficient Linkage Discovery by Limited Probing , 2003, Evolutionary Computation.