摇树优化器从上到下遍历依赖图谱,并且摇掉用不到的代码,这些代码就像是圣诞树中那些死掉的松针一样。
Tree Shaker walks the dependency graph, top to bottom, and shakes out unused code like dead needles in a Christmas tree.
基于上述分析,提出了决策树优化算法。
Based on the above analysis, a new algorithm of decision tree induction is proposed.
AOT编译为接下来通过一个叫做摇树优化的过程做好了准备。
AOT compilation sets the stage for further optimization through a process called Tree Shaking.
ReiserFS使用了特殊的优化b*平衡树(每个文件系统一个)来组织所有的文件系统数据。
ReiserFS uses a specially optimized b* balanced tree (one per filesystem) to organize all filesystem data.
根据这些算法和关系代数等价定理,给出了对关系代数查询树进行逻辑优化的规则,并证明了逻辑优化的正确性。
With these algorithms and the equivalence theory, the several rules to logically optimize the accessing trees were presented and the correctness for the logical optimization was proved.
组播树特征伸长度模型通过寻找路径伸长度密集分布区域来评价组播路径的优化程度。
By looking for the areas where stretch values are dense, the stretch eigen-value model judges optimization degree of multicast paths.
本文采用松驰迭代与约束树搜索相结合的策略,获取优化的匹配结果。
The strategy which combines relaxation and constrained tree-searching is employed to obtain the optimal matching result.
GCC4为标准的编译器套件带来了很多变化,最大的变化是为了支持优化而引入的树的StaticSingleAssignment (ssa)形式。
GCC 4 brings many changes to the standard compiler suite, the biggest of which is around support for optimizations with the introduction of the tree Static Single Assignment (SSA) form.
同时提出获得优化树的修正逐步生成法。
Meanwhile, the revised stepwise generating method for obtaining optimal trees is proposed.
提出了一种适合于大规模高维数据库的组合优化决策树算法。
A combined optimization decision tree algorithm suitable for a large scale and high dimension data-base is presented.
详细设计了DCRTP组播树的形成、维护和优化,设计了DCRTP控制环的形成和恢复。
The formation, maintenance and optimization of DCRTP's multicast tree and the formation, recovery of DCRTP's control ring are designed in detail.
分析现有信誉模型,提出一种使用信任机制和推荐机制的P 2 P信誉模型,利用决策树思想优化该模型。
This paper analyzes existing reputation models, proposes a P2P reputation model using trust mechanisms and recommendation mechanisms, and optimizes the model by the mentality of decision tree.
柔性神经树模型的结构和参数优化分别由概率增强式程序进化和模拟退火算法完成。
The structure and parameters of the flexible neural tree model are optimized by probabilistic incremental program evolution and simulation annealing, respectively.
虽然其在规则设置与参数优化上还是存在着一些不足,但仍可以看出计算动词决策树是一个非常强大和有效的工具。
Though there are some shortages in rules setting and parameter optimization, the computational verb decision trees are powerful and useful tools.
generic树被转换成GIMPLE形式,进而转换成控制流图,以支持基于SSA的优化。
The GENERIC trees are converted into GIMPLE form and a subsequent control flow graph to support SSA-based optimizations.
研究流量约束最小生成树问题(CMST),它是通讯和网络优化设计中最为基础和重要的问题之一。
The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.
优化过程中,能量函数关于光学参数的梯度计算是关键,本文提出一种基于梯度树的梯度求解方法。
In the process of optimization, the gradient computation of the energy function with respect to optical parameters is critical, for which, an algorithm based on the gradient tree is put forward.
服务器只获取那些由用户展开的节点,这可以优化树的性能。
Only those nodes that are expanded by the user will be fetched from the server, which can result in better performance of the tree.
在这个过程中,应用了决策树归纳学习的优化原则,使得生成的决策树能最简洁、准确地描述神经网络学到的知识。
In the process of constructing tree, three optimization principles are adopted to concisely and accurately describe the knowledge that the networks have learned.
针对虚拟设计中的方案树搜索树问题提出一种新的优化模型,并结合人工神经网络技术加以解决。
This paper presents an optimization model of virtual design for project search tree problem, which can be solved by using the characteristic artificial neural net.
采用二叉树森林数据结构来描述结构试验的杠杆加载系统,在此基础之上对加载系统的优化设计方法进行了研究。
The binary tree forest data structure is used to describe the lever load system of structure test. On the basis of this description, a optimum method of load system design is studied.
文中讨论了基于相关性矩阵的测试点优化方法和故障诊断树的生成方法。
The problems of optimal test point selection and optimal diagnosis tree generation are discussed in this paper.
由于双平面X射线造影系统只能提供两幅有限的投影数据,冠状动脉树的三维重建在匹配、优化几何变换矩阵等方面存在困难。
The purpose of this study is to provide a 3D reconstruction of the skeleton of the coronary artery tree from two X-ray angiograms acquired on a biplane angiographic system.
本文讨论一种非正则的评价函数和它的最优化的一种准则,给出在这种准则下构造按字典次序的最优二元树的一种算法。
The paper discusses a nonregular cost function and its optimum criterion, presenting an algorithm of constructing and optimal alphabetic binary tree under this criterion.
本文讨论一种非正则的评价函数和它的最优化的一种准则,给出在这种准则下构造按字典次序的最优二元树的一种算法。
The paper discusses a nonregular cost function and its optimum criterion, presenting an algorithm of constructing and optimal alphabetic binary tree under this criterion.
应用推荐