查询词典 combinatorial problem

The problem on the existence of large sets of Kirkman triple systems is one of problems in combinatorial designs theory, which is of long history and hard to study.

Kirkman三元系大集的存在性问题是历史悠久且研究最困难的组合设计问题之一。

Knap problem ; artificial neural network ; energy function ; combinatorial optimization

背包问题；神经网络；能量函数；组合优化

The maximum clique problem is one of the classic NP-complete problems from combinatorial optimization.

最大团问题是组合优化中的一个经典的NP-Complete问题。

The problem of set partitions in combinatorial mathematics is conside-red, and the following three points are emphasized:(1) the non-recursivealgorithm for computing the number of partitions of an N-Set, P;(2)the algorithm for mapping the partition vector V to the partition sequencenumber D;(3) the algorithm for mapping the partition sequence number Dto the partition vector V.

本文对组合数学中的集合划分问题进行了一些探索，试图回答下面三个问题：①集合划分方法数P的非递归算法，②划分向量V映射到划分序号D的算法，③划分序号D映射到划分向量V的算法。本文以划分的构造树为基础，加以变换，得到数目树和分块树，由此求得P，以及K块划分方法数P_K。

So it has been an open problem and the front of Operational Research and Combinatorial Optimization.

车辆优化调度问题已经成为运筹学与组合优化领域的前沿与研究热点问题。

The main goal of this dissertation is to develop and analyze interior-point algorithms and their variants for solving semi-definite, quadratic, combinatorial and nonlinear optimization problem that arise in production management, resource allocation, communication networks and computer science.

本文主要讨论和分析了内点算法的基本理论和基本思想，并将其推广来求解一般的半正定规划、二次规划、组合优化以及非线性规划问题，这些问题在工业生产管理、资源分配、网络通讯和计算机技术等领域中是会经常碰到的。

Calculating the satisfiable probability, besides being a combinatorial challenge, has appeared as a better way to understand the structure of random SAT problem.

计算可满足概率不仅仅是一个挑战性的组合问题，也是理解随机SAT问题结构的一种较好途径。

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能够探测到环境变化，找到当前最优解。

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

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

The problem for emergency combinatorial dispatch scheme with a restrained demand is discussed in this paper.

本文讨论有资源需求约束的多出救点应急组合调度方案的求取问题。

The studies on the developing of new media are very important to the increasing of the area density of HDD and to the implementation of hybrid recoding technology.

光磁混合记录方法，是一种可以突破超顺磁极限的限制，并进一步提高硬盘记录密度和读写速率的一种新型超高密度信息存储方式。

In io, mTOR inhibition promotes T cell anergy under conditions that would normally induce priming.

体内研究中，在正常可激发免疫反应的条件下，抑制mTOR可促使T细胞无能。