摘要
1 Seed Selection Genetic Programming In Genetic Programming,each tree in population shows an algebraic or surmounting ex- pression,and each algebraic or surmounting expression shows an approximate analytic solution to differential equations.Paper^([1]) give us a theory and method to find approximate
In Genetic Programming, each tree in population shows an algebraic or surmounting expression, and each algebraic or surmounting expression shows an approximate analytic solution to differential equations. Paper give us a theory and method to find approximate analytic solutions for differential equations with normal Genetic Programming. But this method has three disadvantages： finding is blindness, convergence speed is slow and it easily gains into local infinitesimal.
出处
《数学进展》
CSCD
北大核心
2007年第3期382-384,共3页
Advances in Mathematics（China）
基金
This work is supported by a grant of Scientific Research Foundation from Hunan Education Department(No.05C185).
