Publication | Closed Access
How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time
96
Citations
2
References
1996
Year
Mathematical ProgrammingComputational Complexity TheoryMarkov Chain AnalysisEngineeringAlgorithmic Information TheoryRandomized AlgorithmElitist SelectionComputational ComplexityTime ComplexityProbabilistic ComputationProbability TheoryComputer ScienceCombinatorial OptimizationBounded NumberPolynomial Expected TimeExponential Algorithm
It is shown by means of Markov chain analysis that unimodal binary long-path problems can be solved by mutation and elitist selection in a polynomially bounded number of trials on average.
| Year | Citations | |
|---|---|---|
Page 1
Page 1