discrete optimization

discrete optimization的基本解释

-

离散最优化

与discrete optimization相关的网络例句 [注：此内容来源于网络，仅供参考]

Discrete calculus , discrete probability distribution s, discrete Fourier transform s, discrete geometry , discrete logarithm s, discrete differential geometry , discrete exterior calculus , discrete Morse theory , difference equation s, and discrete dynamical system s.

在应用数学中，离散模型连续模型的离散近似。在离散模型中，离散方程are fit to 数据。使用递推关系是这种建模方式的一般方法。时标微积分是差分方程理论与微分方程理论的统一，应用在需要建立离散和连续同步数据模型的领域。

The traditional query tree optimization methods,parallel database optimization methods based on left linear trees and right linear trees,bushy trees,and operation of the forest,have their own pros and cons,they have been more in-depth and maturity of the study.The query optimization method based on multiple weighted tree has studied its model of parallel query plan,its complexity model of parallel query plan and query optimization algorithms.The semantic query method transforms an inquiry into one or several semantic equivalence inquiries then has to find and implement a strategy to achieve a better query.Agent-based parallel database query optimization using Multi-Agent technology to automatically search the integrity constraint conditions which are related to the determined query,there for,the efficiency between several relations' joins has been greatly improved.The parallel optimization algorithm,based on genetic algorithm which is suitable for multi-joins of cluster environment,has deeply studied the relations storage options,multi-joins query optimization and query processing and other key technologies based on cluster parallel database.

传统的查询树优化方法，即基于左线性树、右线性树、浓密树、操作森林的并行数据库查询优化方法，各有优劣，对其的研究比较深入、成熟；基于多重加权树的查询优化方法，研究了其并行查询计划模型、并行查询计划的复杂性模型和查询优化算法；语义查询优化方法将一个查询变换成一个或数个语义等价的查询，进而寻找并执行这些等价查询中具有较好实现策略的一个；基于Agent的并行数据库查询优化采用Multi-Agent技术自动查找与给定查询有关的完整性约束条件，使得多个关系间连接操作的效率得到很大的提高；基于遗传算法的并行优化算法，深入研究了基于机群并行数据库中关系存储的选择、多连接查询优化和查询处理等关键技术。

There exits several MDO algorithms. But they are in our opinion either nonefficient or complicated. So we devised an algorithm called Subspace Approximation Optimization . In the SAO algorithm, the whole system is decomposed into one system-level optimization and several disciplinary optimizations so that a large and complicated problem can be divided into several easy-solving sub-problems. The coupling relationships and the coordination among disciplines are presented by equality constraints and these equality constraints are assigned to relevant disciplines. The optimums of design variables in system level optimization are transferred to discipline level optimization. The optimums of design variables in discipline level correspond to the point that is the nearest to the optimums of design variables in system level. If the optimums of design variables in system level are out of feasible region of discipline 1eve1, linear constraints can be built in the system level optimization using the design variable optimums obtained by the discipline level optimization. The system level optimization would improve the design of the whole system with these linear constraints.

目前，国内外已经发展出了多种飞机多学科设计优化算法，本文的重点是针对协同优化算法的不足，提出了子空间近似优化算法(Subspace ApproximatingOptimization，SAO)，SAO算法中，整个系统的优化问题被分解成一个系统级优化和若干学科级优化，而各个学科之间的耦合与权衡关系则被当作等式约束，这些等式约束将被分配到各个学科级优化中去，系统级优化的任务是寻找整个系统的最优解，而学科级优化的目标函数是以系统级优化分配下来的设计点为圆心的超球半径的平方，因此，如果系统级优化分配下来的设计点在学科级优化可行域内，则学科级优化目标函数为0，反之，则学科级优化的最优点是系统级优化当前设计点距离可行域最近的点。

与discrete optimization相关的网络解释 [注：此内容来源于网络，仅供参考]

discrete optimization：离散最佳化

discrete mathematics 离散数学 | discrete optimization 离散最佳化 | discrete optimization problem 离散最优化问题

discrete optimization：离散寻优

信息:Discrete Hopfield Neural Networks | 离散寻优:discrete optimization | 离散时间:discrete-time

discrete optimization：离散最优化

离散族|discrete family | 离散最优化|discrete optimization | 离心角|eccentric angle

discrete optimization：<离散优化》荷兰

10. DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS >荷兰 | 11. DISCRETE OPTIMIZATION >荷兰 | 12. ENGINEERING OPTIMIZATION >英国

discrete optimization problem：离散最优化问题

discrete optimization 离散最佳化 | discrete optimization problem 离散最优化问题 | discrete problem 离散问题