UC知道遗传编程翻译2
来源：百度知道 编辑：UC知道 时间：2024/06/08 20:01:15
In high performance environments, the tree-based representation of programs
may be too inefficient since it requires the storage and management
of numerous pointers. In some cases, it may be desirable to use GP primitives
which accept a variable number of arguments (a quantity we will call
arity). An example is the sequencing instruction progn, which accepts any
number of arguments, executes them one at a time and then returns thevalue returned by the last argument. However, fortunately, it is now extremely
common in GP applications for all functions to have a fixed number
of arguments. If this is the case, then, the brackets in prefix-notation expressions
are redundant, and trees can efficiently be represented as simple
linear sequences. In effect, the function’s name gives its arity and from the
arities the brackets can be inferred. For example, the expression (max (+ x
x) (+ x (* 3 y))) could be written unambiguously as the sequ
may be too inefficient since it requires the storage and management
of numerous pointers. In some cases, it may be desirable to use GP primitives
which accept a variable number of arguments (a quantity we will call
arity). An example is the sequencing instruction progn, which accepts any
number of arguments, executes them one at a time and then returns thevalue returned by the last argument. However, fortunately, it is now extremely
common in GP applications for all functions to have a fixed number
of arguments. If this is the case, then, the brackets in prefix-notation expressions
are redundant, and trees can efficiently be represented as simple
linear sequences. In effect, the function’s name gives its arity and from the
arities the brackets can be inferred. For example, the expression (max (+ x
x) (+ x (* 3 y))) could be written unambiguously as the sequ
在高性能的环境，树为基础的代表性节目<br>可能是过于低效，因为它需要存储和管理<br>众多的三分球。在某些情况下，可取的做法可能是使用GP的原始<br>其中接受可变数目的论据（一数量我们会打电话给<br> arity ） 。其中一个例子是测序的指示progn ，其中接受任何<br>若干论据，执行他们一在一个时间，然后再返回thevalue经由过去的说法。不过，幸运的是，现在是极为<br>共同在GP的申请，所有的职能有一个固定号码<br>论据。如果是这种情况，那么，括号内的前缀符号表达<br>是多余的，和树木可以有效地派代表作为简单<br>线性序列。实际上，该功能的名称，给出了arity和从<br> arities括号内可以推断。举例来说，表达（最大值（ + x年<br> x ）的（ + X （下* 3 y ）的） ）可以书面毫不含糊地作为序列最高<br> + x年x + x年* 3耀<br>选择是否要使用这种线性任职或一个明确的<br>树表示，通常为指导的问题，方便，效率， <br>遗传行动正在使用（有些人可能更容易或更有效<br>在实施一代表） ，和其他数据一不妨<br>收集在运行。 （有时这是有用的附加额外的信息<br>以节点，这可能是更容易执行，如果他们明确<br>派代表出席会议） 。 <br>这些树交涉，是最常见的在GP的，例如，许多<br>高品质，免费提供GP的实现使用它们（见<br>资源在附录A ， 148页，以取得更多资讯）等，是否也<br>很简单， GP的系统描述在附录B然而，也有其他<br>重要的交涉，其中一些是讨论在第7章