Access the full text.
Sign up today, get DeepDyve free for 14 days.
[This chapter describes a chaos based random walk (CRW) algorithm for analyzing landscape structure in continuous search spaces. Unlike the existing random walks, no fixed step size is required in the proposed algorithm, rather conduct the random walk. The chaotic map is used to generate the chaotic pseudo random numbers (CPRN) for determining the variable-scaled step size and direction. The superiority of the new method has been demonstrated while comparing it with the simple and progressive random walk algorithms using histogram analysis. The performance of the proposed CRW algorithm is evaluated on the IEEE Congers on Evolutionary Computation (CEC) 2013 benchmark functions in continuous search space having different levels of complexity. The proposed method is applied to analyzing the landscape structure for protein structure prediction problem in continuous search space.]
Published: Mar 3, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.