本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：1994
摘要
This paper presents a comparison of 遺傳 Programming(GP) with Simulated Annealing (SA) and 隨機 Iterated Hill Climbing (SIHC) based on a suite of program discovery problems which have been previously tackled only with GP. All three search algorithms employ the hierarchical variable length representation for programs brought into recent prominence with the GP paradigm [8]. We feel it is not intuitively obvious that 突變-based adaptive search can handle program discovery yet, to date, for each GP problem we have tried, SA or SIHC also work.
※ 此為已發表論文，全文需透過期刊付費取得