November 2005
Intermediate to advanced
304 pages
6h 14m
English
![]()
For some tasks, it's not always easy finding the correct algorithm or sequence of steps to perform the work. This is especially true for processes that require frequent changes to an algorithm to match changing circumstances in the program's environment. In situations like these, you may be able to write a program that evolves a solution. This is called a genetic algorithm (GA). This type of programming works by trying many possible solutions and selecting the ones that perform the best. ...
Read now
Unlock full access