I just finished Albert-László Barabási's popular science book "Bursts: The Hidden Pattern Behind Everything We Do" which describes the Lévy flight as an ideal strategy for finding scarce resources in an environment. I immediately wondered whether anyone had studied them as a search algorithm. I could imagine them being more or less useful depending on the makeup of the search space. Have there been any papers on the subject?
closed as off topic by Kaveh Mar 11 '11 at 5:16
Questions on Theoretical Computer Science Stack Exchange are expected to relate to research-level theoretical computer science within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here. If this question can be reworded to fit the rules in the help center, please edit the question.