公开(公告)号：US06260031B1

公开(公告)日：2001-07-10

申请号：US09217408

申请日：1998-12-21

申请人： J. David Schaffer ,  Keith E. Mathias ,  Larry J. Eshelman

发明人： J. David Schaffer ,  Keith E. Mathias ,  Larry J. Eshelman

IPC分类号： G06N312

CPC分类号： G06N3/126

摘要： A code compaction based on macro substitutions is presented wherein the choice of possible macro substitutions is guided by an evolutionary algorithm process. In a preferred embodiment, a random population of sets of macro substitutions are generated and a compaction effectiveness is evaluated for each set. This random population is partitioned into pairs of “parents”, and each pair of parents produce a pair of “offspring”. The effectiveness of the compaction provided by each of the offspring is evaluated, and a “survival of the fittest” algorithm is applied to identify the individuals that have the best compaction effectiveness. These preferred individuals are partitioned into pairs of parents who produce pairs of offspring, and the most compaction-effective individuals are selected to be parents for the next generation. This process continues until subsequent generations show insignificant improvement, and the best individual is selected as the solution.

摘要翻译： 提出了基于宏替代的代码压缩，其中可能的宏替换的选择由进化算法过程指导。 在优选实施例中，生成一组随机的宏替代集合，并且针对每个集合来评估压缩效果。 这个随机人口被划分成“父母”对，每对父母都产生一对“后代”。 评估每个后代提供的压实的有效性，并应用“适者生存”算法来识别具有最佳压实效果的个体。 这些优选的个体被分成成对的父母，其中产生成对的后代，并且最压实有效的个体被选择为下一代的父母。 这个过程一直持续到下一代显示出微不足道的改善，最好的个人被选为解决方案。