论文信息 - Approximation Speed-Up by Quadratization on LeadingOnes - 字舞流文

Approximation Speed-Up by Quadratization on LeadingOnes

Andrew M. Sutton | L. Darrell Whitley

[1] Benjamin Doerr,et al. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics , 2018, Theory of Evolutionary Computation.

[2] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[3] P. Stadler. Landscapes and their correlation functions , 1996 .

[4] Andrew M. Sutton,et al. A polynomial time computation of the exact correlation structure of k-satisfiability landscapes , 2009, GECCO '09.

[5] L. Darrell Whitley,et al. A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms , 1998, AAAI/IAAI.

[6] Daniel Freedman,et al. Energy minimization via graph cuts: settling what is possible , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[7] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..

[8] Thomas Jansen,et al. On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm , 1998, PPSN.

[9] P. Stadler,et al. The landscape of the traveling salesman problem , 1992 .

[10] Endre Boros,et al. On quadratization of pseudo-Boolean functions , 2012, ISAIM.