Asynchronous Migration in Parallel Genetic Programming
by
Shisanu Tongchim
,
Prabhas Chongstitvatana
Add To MetaCart
Abstract:
this paper, the quality of the solution is definedintermsoftherobustness. The robustness of the generated programs from the parallel algorithm was demonstrated to be better than the serial algorithm. Consequently, the amount of work from the parallel algorithm in this experiment was not less than the serial algorithm.
Citations
| 127 | Designing e#cient and accurate parallel genetic algorithms. Doctoral dissertation – Cantu-Paz - 1999 |
| 6 | Improving Robustness of Robot Programs Generated by Genetic Programming for Dynamic Environments – Chongstitvatana - 1998 |

