The univariate marginal distribution algorithm copes well with deception and epistasis (Q2057117): Difference between revisions

@@ Property / arXiv ID @@
+.08277
@@ Property / arXiv ID: 2007.08277 / rank @@
+Normal rank
@@ Property / cites work @@
+Analyzing randomized search heuristics via stochastic domination
+Normal rank
@@ Property / cites work @@
+Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
+Normal rank
@@ Property / cites work @@
+A rigorous analysis of the compact genetic algorithm for linear functions
+Normal rank
@@ Property / cites work @@
+On the analysis of the \((1+1)\) evolutionary algorithm
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax
+Normal rank
@@ Property / cites work @@
+On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help
+Normal rank
@@ Property / cites work @@
+On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
+Normal rank
@@ Property / cites work @@
+Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
+Normal rank