On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements? (Q1725659): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-018-0462-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2808518210
@@ Property / OpenAlex ID: W2808518210 / rank @@
+Normal rank
@@ Property / cites work @@
+On the mixing time and spectral gap for birth and death chains
+Normal rank
@@ Property / cites work @@
+Q5538132
@@ Property / cites work: Q5538132 / rank @@
+Normal rank
@@ Property / cites work @@
+Equation of State Calculations by Fast Computing Machines
+Normal rank
@@ Property / cites work @@
+On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements?
+Normal rank
@@ Property / cites work @@
+How to escape local optima in black box optimisation: when non-elitism outperforms elitism
+Normal rank
@@ Property / cites work @@
+Q3224102
@@ Property / cites work: Q3224102 / rank @@
+Normal rank
@@ Property / cites work @@
+Toward a unifying framework for evolutionary processes
+Normal rank
@@ Property / cites work @@
+Towards a runtime comparison of natural and artificial evolution
+Normal rank
@@ Property / cites work @@
+Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
+Normal rank
@@ Property / cites work @@
+Using markov-chain mixing time estimates for the analysis of ant colony optimization
+Normal rank