computing complexity中文是什么意思

• 计算复杂性

• compute    vt.,vi. 计算，估计；算定。 compute ta ...
• complexity    n. 1.复杂性，复合状态。 2.复合物；复杂的事物[情 ...
• complexity of computing    计算复杂性
• complexity    n. 1.复杂性，复合状态。 2.复合物；复杂的事物[情况]。
• computing    电脑运算; 计算的估计的; 计算机系; 计算机信息处理技术
• advancing complexity    进化综合
• algorithm complexity    算法复杂性
• algorithmic complexity    算法复杂性
• asymptotic complexity    渐近复杂性
• aufwand complexity    复杂性
• business complexity    业务复杂性
• chemical complexity    化学复杂度
• circuit complexity    电路复杂性
• clonal complexity    克隆复杂性
• code complexity    代码复杂性
• cognitive complexity    认知复杂性
• complexity analysis    成分分析
• complexity class    复杂度类; 复杂性类
• complexity factor    复杂度系数; 复杂性因子; 复杂性指示; 复杂因数
• complexity graph    复杂性图形
• complexity measure    复杂性度量
• complexity metrics    复杂性度量
• complexity of computation    计算的复杂性; 计算复杂性
• complexity of emotion    情绪的复杂性
• complexity of interface    接口复杂性

• We found that the ergodic method used to calculate the symmetries of a multidimensional system would give rise to the computing complexity problem , hi order to avoid the computing complexity problem , we present a novel approach using genetic algorithms for calculating the permutation symmetries of a patterns set and the weight matrix of the network . we design the corresponding computer program with visual c + + 6 . 0 language . and numerical simulat
  并用wsualc语言分别设计了求解网络连接矩阵和给定样本集的置换对称性相应的遍历法和遗传算法的程序，在pc机上进行数值模拟计算，比较遍历法和遗传算法的计算结果。
• Abstract : an algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells ic design . due to the limitation of computing complexity , an effective and efficient initial placement is very important for detailed placement . novelty of this algorithm lies in a better solution at initial stage by using network - flow method to satisfy row capacity constraint and the thought of linear placement problem ( lpp ) to resolve overlaps . moreover , divide - and - conquer strategy and other simplified methods are adopted to minimize complexity . experimental results show that the algorithm can get an average of 16 wire length improvement on paflo in reasonable cpu time
  文摘:以大规模混合模式布局问题为背景,提出了有效的初始详细布局算法.在大规模混合模式布局问题中,由于受到计算复杂性的限制,有效的初始布局算法显得非常重要.该算法采用网络流方法来满足行容量约束,采用线性布局策略解决单元重叠问题.同时,为解决大规模设计问题,整体上采用分治策略和简化策略,有效地控制问题的规模,以时间开销的少量增加换取线长的明显改善.实验结果表明该算法能够取得比较好的效果,平均比paflo算法有16的线长改善,而cpu计算时间只有少量增加
• However , because bayes network structure learning algorithm generally explore too big a search space , as well as its computing complexity , and moreover , the such learning algorithm is very easy to fall into the local optimal solution , ban ’ s efficiency is questioned . finding a kind of highly effective global searching algorithm is an extremely important to the study of ban
  针对这种分类器的结构学习,设计了结合对数似然的适应度函数,并给出了网络结构的编码方案,设计了相应的遗传算子,使得该算法能够收敛到全局最优的结构。实验结果表明,该算法具有良好的分类效果。
• The optimum multiuser detection can obtain the best bit error rate theoretice . but its computing complexity increases with the number of users exponentially and belongs to np maturity problem . so much research fasten on the multiuser detection with low computing complexity . cdma multiuser detection is in fact a combination optimize problem
  基于最大似然准则的最佳多用户检测器在理论上可以获得最小的误码率,提供最佳的检测性能,但其计算复杂度随用户数呈指数增长,属于np完备问题,因此大量的研究集中于发展计算复杂度较低的次最佳多用户检测器,使其具有合理的计算复杂度。
• The creative work of the paper is to simplify the design process in the way of introducing custom instruction , which makes best use of the advantage of nios to add or reduce peripherals to meet the actual requirement . in this way an instruction is operated on nios to improve speed and decrease computing complexity
  论文创造性的工作在于,提出采用一种自定制指令的方式将fir滤波器设计简化,充分应用nios软核可以在设计阶段依据实际需要来增减外设数量和种类的优点,在nios上以一条指令的方式运行,从而提高了运行速度,降低了运算复杂度。
• To mine it , a novel method based on artificial immune gene expression programming ( aigep ) was introduced , where , new structures of antibody and immune cell were designed to decrease computing complexity , the special negative select strategy was presented to eliminate invalid or redundant immune cells according to system requirements , and a heuristic mdcar reduction criterion was introduced , that is , a strong rule is fine only if the contra - positive of it is strong
  构造了有特色的抗体和免疫细胞结构，能有效减少计算量；设计了特有的否定选择策略，可以消除无用的和冗余的免疫细胞；引出了逆否规则与原规则同为强规则的启发式过滤准则，可有效约简规则数目。
• In addition , the work speed is very low in the methods with no parameters . therefore , we focus on proceeding the algorithm ' s performance with increasing the speed of searching non - dominated solutions , reducing the number of non - dominated solutions in precondition of ensuring a better distribution of individuals , and constructing new populations . the multi - objective genetic algorithm based on sorting and clustering efficiently increase its run efficiency , debase its compute complexity and improve its convergence performance
  为此，本文的研究主要就是从提高寻找非支配集的速度，在保持群体原有特性的前提下降低非支配集的大小，以及新群体的构造等方面入手，通过基于分类和聚类的方法，有效提高多目标遗传算法总体运行效率，降低其计算复杂性，使多目标遗传算法的收敛性能得到进一步改善。
• Because the high resolution on high frequency of wavelet package meets the feature of fingerprint containing abundant high frequency , we filtered the fingerprint preliminarily by means of wavelet package . while designing orientation filter , we introduced the square - circle transform to rotate filter , thus we reduced computing complexity and avoided imported errors
  具体地，结合指纹图像中高频丰富的特点，以及小波包高频分辨率高的分析特性，选用小波包对指纹图像进行初滤波；在设计方向滤波器时，对滤波器的旋转引入了方?圆变换的方法，进而减少了计算的复杂度，同时避免引入误差。
• Firstly , a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline , since the problem is npc , a unified polynomial algorithm which satisfies engineering requirement is unavailable . illuminated by the practical experience , a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands , tna based on fleet balance application , tna based on minimum fleet requirement ; secondly , by simplifying and relaxing some minor constraints , corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally , computing complexities are discussed
  为此论文在借鉴手工编制排班计划经验的基础上，将一个具体的飞机排班问题，归结为三种典型排班模式中的一种，即：基于飞机调度指令要求的排班问题，基于飞机使用均衡要求的排班问题和基于最少需用飞机数的排班问题，对于每种典型的飞机排班模式，在对次要的约束条件进行简化、松驰的基础上构造出相应的能够满足工程应用要求的启发式算法，并分析了算法的复杂性。
• A modified k - means method which can reduce compute complexity greatly is proposed to cluster similar customers . churn prediction adopts decision trees algorithms . after presenting a brief overview of tree - building algorithm and tree - pruning algorithm of traditional decision trees , the paper describes how to push constraints into the tree - building phase and tree - pruning phase in detail
  离网预测采用了决策树分类器，本文在描述决策树算法中所涉及到的建树、代价计算、剪枝等问题之后，给出了在建树中和建树后分别加入限制条件的修剪算法。