Analysis of recombinative algorithms on a non-separable building-block problem

@inproceedings{Watson2000AnalysisOR,
  title={Analysis of recombinative algorithms on a non-separable building-block problem},
  author={Richard A. Watson},
  booktitle={FOGA},
  year={2000}
}
We give an upper bound on the expected time for a r ecombinative algorithm to solve a non-separable building-block p roblem. The analysis proceeds by proving the existence of a pat h to he solution and calculating the time for each step on this path. Or dinarily, such a straightforward approach would be defeated because both the existence of a path, and the time for a step, are dependent o n the state of the population when using recombination. However, to ca lcul te an upper bound on the… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

51 Citations

0510'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Markov Chain Models

  • AH Wright, Y Zhao
  • 1999
Highly Influential
6 Excerpts

2000b, “Recombination Witho

  • RA Watson, JB Pollack
  • 2000
2 Excerpts

Gene Expression: The Missing

  • H Kargupta
  • 1997
1 Excerpt

Are long path problems

  • Mateo San, C CA. Hoehn, C Reeves
  • 1996

Similar Papers

Loading similar papers…