查询词典 combinatorial

By the means of combinatorial matrix, the relation between minimum degree of connected graph and upper bound of spectral radius was carefully depicted.

利用组合矩阵方法，精细地刻画出连通图的最小度与谱半径的上界之间的关系，在一定条件下改进了以前的一个结果。

I present cluster schema for combinatorial problem with clustering, design a new crossover operator cluster crossover, study the survival probability of c-schema under c-crossover, apply it successfully to graph coloring, load balancing and maximum spanning tree problems: give measurements of diversity in GA, set up varying crossover probability algorithms to maintain diversity, obtain good results when apply it in avoiding premature convergence and multi-modal functions optimization; establish GAC to be suitable for non stationary function, it can explore the change of environment and find the best solution even for some"anomalous"function.

针对聚类组合优化问题提出了聚类模式，设计了一种新的交换操作：聚类交换并研究了聚类模式在聚类交换操作下的生存可能性，成功的将聚类交换思想和算子应用于图着色、负载平衡和最大生成树问题，佐证了类理论，表明类理论可以指导新的应用算法设计；给出了GA中多样性的度量标准和维护多样性的动态交换概率算法，用于避免过早收敛和多峰函数优化，取得了较好的结果；构造了维持种群多样性以适应动态环境的方法GAC，在某些现有方法无能为力的问题上，GAC能够探测到环境变化，找到当前最优解。

According to the mapping principle of stereographic projection, the combinatorial relationships of line and plane can be solved by use of mathematic analysis.

摘要根据赤平投影的成图原理，利用数学解析的方法，可直接求解有关线与面的组合关系。

The experiments and case study show that the method is feasible and effective, and it can considerably reduce the number of combinatorial test cases for some SUT with definite dependent relationships among input parameters.

实验结果证明该方法是可行和有效的，对于一些输入参数依赖关系明确的被测系统，该方法能够较大幅度地精简全组合测试用例集。

Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems.

组合的列举是充满被容易一个容易可达到的主题说明，但是有时tantalizingly 难的问题。

Based on typical stochastic functional and combinatorial optimization problems, the effects of hypothesis test, performance estimation number and magnitude of noise on the performance of the approach are studied, and the effectiveness and robustness of the proposed approach are demonstrated.

基于典型的随机函数优化和组合优化问题，仿真研究了假设检验、性能估计次数、噪声幅度对算法性能的影响，验证了所提方法的有效性和鲁棒性。

Besides giving new proofs of known identities, the author establishes several interesting product identities, and discusses briefly applications to combinatorial computations as well as analytic theory of numbers.

在对已有恒等式提供新的证明的基础上，作者发现许多新的有趣的乘积恒等式，并详细讨论它们在组合计算，解析数论等方面的应用。

Traveling Salesman Problem is one of most widely studied combinatorial problems.

旅行商问题是研究最为广泛的组合优化问题，在现实生活中，也有着广泛的应用。

When we applied Trawler to data from yeast and mammals, 83% of the known binding sites were accurately called, often with other additional binding sites, providing hints of combinatorial input.

我们用Trawler对酵母和哺乳动物的数据进行分析，结果显示83%的已知结合位点被精确识别，而且有其他结合位点，提供了组合输入的暗示。

The structured properties of tridiagonal inverse M-matrices are then studied in detail by using graph theory and combinatorial mathematics, and a sufficient condition for a nonnegative tridiagonal matrix to be an inverse M-inatrix is given.

第一部分分析证明了逆M-矩阵的结构特点和在Hadamard积下的封闭性；第二部分分析几类特殊矩阵的结构特点，以及它们逆矩阵的构造方法；第三部分研究对称不定矩阵秩一校正的Bunch-Kaufman分解和相应的算法。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。