| 000 | 00981 a2200253 4500 | ||
|---|---|---|---|
| 005 | 20250526161932.0 | ||
| 008 | 250430042019xx eng | ||
| 020 |
_a9781420050073 _qEA |
||
| 037 |
_bTaylor & Francis _cGBP 160.00 _fBB |
||
| 040 | _a01 | ||
| 041 | _aeng | ||
| 072 | 7 |
_aUY _2thema |
|
| 072 | 7 |
_aUB _2thema |
|
| 072 | 7 |
_aUY _2bic |
|
| 072 | 7 |
_aUB _2bic |
|
| 072 | 7 |
_aMAT000000 _2bisac |
|
| 072 | 7 |
_aMAT021000 _2bisac |
|
| 100 | 1 |
_aLance D. Chambers _9902 |
|
| 245 | 1 | 0 |
_aPractical Handbook of Genetic Algorithms _bNew Frontiers, Volume II |
| 250 | _a1 | ||
| 260 |
_bCRC Press _c20190917 |
||
| 300 | _a464 p | ||
| 520 | _bThe mathematics employed by genetic algorithms (GAs)are among the most exciting discoveries of the last few decades. But what exactly is a genetic algorithm? A genetic algorithm is a problem-solving method that uses genetics as its model of problem solving. It applies the rules of reproduction, gene crossover, and mutation to pseudo-organism | ||
| 999 |
_c10568 _d10568 |
||