000 | 019650000a22003250004500 | ||
---|---|---|---|
003 | EG-GICUC | ||
005 | 20250223025901.0 | ||
008 | 061205s2005 ua d f m 000 0 eng d | ||
040 |
_aEG-GICUC _beng _cEG-GICUC |
||
041 | 0 | _aEng | |
049 | _aDeposite | ||
097 | _aPh.D | ||
099 | _aCai01.12.17.Ph.D.2005.Ag.N. | ||
100 | 0 | _aAghiad khedr Alkatan | |
245 | 1 | 2 |
_aA novel schema and crossover representation for genetic programming Applications : analysis and practical experimentationt / _cAghiad khedr Alkatan ; Supervised Laila Fahmy Abd El al , Ashraf Hassan Abd El wahab |
246 | 1 | 5 | _aتمثيل المخططات و التزاوج بشكل جديد لتطبيقات البرمجة الجينية تحليل و اختبار |
260 |
_aCairo : _bAghiad khedr Alkatan , _c2005 |
||
300 |
_a203P : _bcharts ; _c30cm |
||
502 | _aThesis (PH.D.) - Cairo University - Faculty Of Science - Department Of Mathematics | ||
520 | _aGenetic programming (GP) addresses the challenge to get a computer do what is need to be done , without telling it how to do it GP provides a method for creating a working computer program automatically from a high - level problem statement of the problem All definitions of schema theory used to analyze and explain the GP , have not been fully exploited nor fully developed In addition to the weaknesses of today's crossover mechanisms , which have been failed to achieve the balance between the disruption and construction force of crossover ; This weaknesses lead to some complications in the computation of the schema - disruption probabilities necessary to formulate schema theorem for GP | ||
530 | _aIssued also as CD | ||
653 | 4 | _aProgramming | |
653 | 4 | _aRepresention | |
700 | 0 |
_aAshraf Hassan Abd El wahab , _eSupervisor |
|
700 | 0 |
_aLaila Fahmy Abd El a , _eSupervisor |
|
856 | _uhttp://172.23.153.220/th.pdf | ||
905 |
_aAml _eCataloger |
||
905 |
_aEsam _eRevisor |
||
942 |
_2ddc _cTH |
||
999 |
_c22758 _d22758 |