153
个编辑
更改
跳到导航
跳到搜索
第87行：
第87行： − 进化计算技术主要涉及元启发式优化算法。一般来说，这个领域包括:+ 第217行：
第217行： − 这种进化过程的许多方面都是随机的。由于重组和突变而改变的信息片段是随机选择的。另一方面，选择运算符可以是确定性的，也可以是随机的。在后一种情况下，适合度较高的个体比适合度较低的个体有更高的机会被选中，但通常即使是体质较弱的个体也有机会成为父本或生存下来。+ 第291行：
第291行： − 进化自动机是进化图灵机<font color="#ff8000"> 图灵机Turing machines</font>的一种推广，为了更精确地研究生物和演化计算的性质，人们引入了它。特别是，他们允许在演化计算的表现力上获得新的结果。这证实了关于自然演化和演化算法及过程不可判定性的初步结果。演化有限自动机是演化自动机中最简单的子类，在终端模式下可以接受给定字母表上的任意语言，包括非递归的可枚举语言(例如，对角化语言)和递归的可枚举但不递归语言(例如，通用图灵机语言)。+ 第387行：
第387行： − 进化计算地区的主要会议包括+
无编辑摘要
Evolutionary computing techniques mostly involve metaheuristic optimization algorithms. Broadly speaking, the field includes:
Evolutionary computing techniques mostly involve metaheuristic optimization algorithms. Broadly speaking, the field includes:
演化计算技术主要涉及元启发式优化算法。一般来说，这个领域包括:
Many aspects of such an evolutionary process are stochastic. Changed pieces of information due to recombination and mutation are randomly chosen. On the other hand, selection operators can be either deterministic, or stochastic. In the latter case, individuals with a higher fitness have a higher chance to be selected than individuals with a lower fitness, but typically even the weak individuals have a chance to become a parent or to survive.
Many aspects of such an evolutionary process are stochastic. Changed pieces of information due to recombination and mutation are randomly chosen. On the other hand, selection operators can be either deterministic, or stochastic. In the latter case, individuals with a higher fitness have a higher chance to be selected than individuals with a lower fitness, but typically even the weak individuals have a chance to become a parent or to survive.
这种演化过程的许多方面都是随机的。由于重组和突变而改变的信息片段是随机选择的。另一方面，选择运算符可以是确定性的，也可以是随机的。在后一种情况下，适合度较高的个体比适合度较低的个体有更高的机会被选中，但通常即使是体质较弱的个体也有机会成为父本或生存下来。
Evolutionary automata, a generalization of Evolutionary Turing machines, have been introduced in order to investigate more precisely properties of biological and evolutionary computation. In particular, they allow to obtain new results on expressiveness of evolutionary computation. This confirms the initial result about undecidability of natural evolution and evolutionary algorithms and processes. Evolutionary finite automata, the simplest subclass of Evolutionary automata working in terminal mode can accept arbitrary languages over a given alphabet, including non-recursively enumerable (e.g., diagonalization language) and recursively enumerable but not recursive languages (e.g., language of the universal Turing machine).
Evolutionary automata, a generalization of Evolutionary Turing machines, have been introduced in order to investigate more precisely properties of biological and evolutionary computation. In particular, they allow to obtain new results on expressiveness of evolutionary computation. This confirms the initial result about undecidability of natural evolution and evolutionary algorithms and processes. Evolutionary finite automata, the simplest subclass of Evolutionary automata working in terminal mode can accept arbitrary languages over a given alphabet, including non-recursively enumerable (e.g., diagonalization language) and recursively enumerable but not recursive languages (e.g., language of the universal Turing machine).
演化自动机是演化图灵机<font color="#ff8000"> 图灵机Turing machines</font>的一种推广，为了更精确地研究生物和演化计算的性质，人们引入了它。特别是，他们允许在演化计算的表现力上获得新的结果。这证实了关于自然演化和演化算法及过程不可判定性的初步结果。演化有限自动机是演化自动机中最简单的子类，在终端模式下可以接受给定字母表上的任意语言，包括非递归的可枚举语言(例如，对角化语言)和递归的可枚举但不递归语言(例如，通用图灵机语言)。
The main conferences in the evolutionary computation area include
The main conferences in the evolutionary computation area include
演化计算地区的主要会议包括
* [[Association for Computing Machinery|ACM]] [[Genetic and Evolutionary Computation Conference]] (GECCO),
* [[Association for Computing Machinery|ACM]] [[Genetic and Evolutionary Computation Conference]] (GECCO),