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-optimi
| This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||
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)
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.