This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
Latest comment: 15 years ago1 comment1 person in discussion
The page says to contrast with GAs, but GAs are often considered a particular kind of randomized optimization algorithm, in the sense that all randomized-optimization algorithms except for a purely random one use some method for trying to bias the randomness towards better regions of the search space, and the mutation/crossover paradigm is one such method. --Delirium (talk) 05:57, 20 January 2009 (UTC)Reply
