解空间

词组短语

solution space

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

The model,based on the solution space of Hamiltonian problem,fixes the DNA molecules of solution space on the solid carrier,and fluorescence labels on them,and then gets all solutions of Hamiltonian circuit problem by certain biochemical actions.

该模型基于哈密尔顿回路问题的解空间，将问题解空间的DNA分子固定在固体载体上，对其进行荧光标记，然后通过相应的生化反应筛选出哈密尔顿回路问题的所有解。

It is proved that the two-dimensional non-hydrostatic Boussinesq equations on the x ? z plane with the kinetic viscous term and the thermal dissipative term are unstable equations in the C 2 function class.2. If we replace the influence of the kinetic viscous term by Rayleigh friction and the thermal dissipative term by Newton cooling, the new generalized equations are stable equations in the C 1 function class. The construction of the solution space and the discriminating method for well-posedness of the problem of determining solution are given.

本文的主要结果如下：1证明了在y方向上均匀的带有运动粘性项以及热耗散项的两维非静力、Boussinesq近似的x-z面上两维旋转流体的控制方程组在C 2函数类中是一个不稳定的方程组。2如果以瑞利摩擦来代替粘性的影响，以牛顿冷却来代替热量的耗散，则所获得的一个新的方程组在C 1函数类中是一个稳定的方程组，给出了其解空间的构造和各种定解问题的适定性的判别方法。

The algorithm of multi-objective fuzzy shoretest path and Pareto solution space are discussed, and a method based on fuzzy inference engine is presented to select multiple Pareto solution.

讨论了多目标模糊最短路径的算法与Pareto解空间问题，提出了基於模糊推理引擎选择多个Pareto解的策略。

If you apply this method to solve problem, most of mechanism synthesis problem will turn into one problem, that is to solve the equation set. The most difficult point is get full solution of the equation set, thus it can provide a wider range for optimized project.

用解方程组法进行机构综合时，大多数机构综合的问题都可以转化为求解非线性方程组的问题，而其难点在于求出非线性方程组的完全解，以便为优选方案提供较大的解空间。

A chaos genetic algorithm was proposed to search the optimal solution in the whole feasible solution space.

提出了一种可在全部可行解空间寻求最优解的混沌遗传算法。

Now HLS has absorbed much research attention in IC-CAD field. In HLS, algorithms represented by algorithm description language are transformed into hardware structure description consisted of resisters and transfers. In the transforming process, synthesis of datapath is a core. The other works is based on it. And in the synthesis of datapath, operation scheduling, functional unit allocation and binding all are NP-Completeness problems. The structure of their solution space is not known well. If we must find a global optimum solution, we can only use exhaustion. This way needs too much computation for VLSI synthesis, and is impractical in Industry. So usually heuristic algorithms are used to search suboptimum solution.

因此HLS成为国际IC-CAD学界的一个热门，它把算法描述语言表达的算法转换为用寄存器、传输器描述的硬件结构，其中以数据通路的综合为主体，其余工作皆以此为基础；而在数据通路综合中，操作调度、功能单元分配、连线等均属NP问题，目前该问题的解空间尚未充分了解，如要求得最优解，只有采取穷举搜索法，对于大规模集成电路而言运算量太大，工业中无法承受，故通常都采用启发算法求次优解。

When the Hamiltonian system is introduced into the research of dynamic buckling in cylindrical shells, the problem uses dual variables in Symplectic space instead of variables in traditional Euclidean space. The symplectic eigenfunction expansion method gives out an exact solution space. So many problems are solved, which can not find the solution in traditional methods.

将哈密顿体系引入结构的动态屈曲研究中，其意义在于将结构的动态屈曲研究从传统的欧几里得几何空间进入到由原变量和对偶变量组成的辛几何空间之中，从而使辛本征函数展开的直接解析法得以实施，这样就可以求解许多以往半逆凑合法无法求解的问题，并且所得到的解空间是完备的。

Through such a study, it is also shown that when the time delay is long enough such that the stability switches of the equilibrium of system halt, the bifurcation branches originated from the critical time delays cannot be surely stable or unstable in the whole solution space, that is, their stability depends on cases.

利用打靶法的数值结果说明了当系统平衡点不再发生稳定性切换时，源自这些临界时滞处的解支的稳定性在整个解空间的稳定性具有不可判定性，这也说明由多尺度法所得高阶近似判定的解支的稳定性事实上只表示解支在局部中心流形上的稳定性，而非在整个解空间中的稳定性。

In this paper, a path planning method based on GA is presented. Firstly, the model of the space robot is built to display the mapping of the end velocity and the joint velocity. Then the optimal algorithm based on genetic algorithm is presented to search the optimal solution which minimizes the disturbance of base attitude in the feasible solution space. Finally, an illustrative example is used to verify the feasibility of the algorithm.

基于GA研究机械臂运动对基座的姿态扰动问题，首先，建立空间机器人的运动学模型及空间机器人末端与关节速度之间的映射关系；接着，应用GA作为最优化算法，在空间机器人可行解空间中，寻找最优解得到最优路径，以达到对基座姿态干扰最小的目的；最后，通过数值仿真实验验证算法的实用性。

The construction of the solution space for shallow-water equations on the equatorialβ?plane and the equations about the tropical circulation to heating are mainly studied. The solution method of exact solution in the analytic function class and the computational procedure to the series solution are expressed for the well-posed problem.

平面近似的浅水方程组和热源强迫的热带环流方程组，重点研究了它们的解空间构造，并给出了各种适定的定解问题在解析函数类空间中准确解的具体的求解方法，并编制程序去计算其级数解。

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

analytic space：解析空间,复空间

analytic solution | 解析解 | analytic space | 解析空间,复空间 | analytic theory | 解析理论

clearing：清除

算法的过程如下:清除(Clearing)算法由Petrowski 提出. 该算法属于适应值共性算法范畴,事先需要给出解空间的小生境半径 (重要参数)和小生境的容量 (次要参数),并假设解空间中峰值半径均相同.

spatial resolution：空间分辨率 空間解像度

■ spatial relationship 空间关系 空間関係 | ■ spatial resolution 空间分辨率 空間解像度 | ■ spatial sampling 空间采样 空間サンプリング

spatial soliton：空间孤子

类孤波解:soliton-like solution | 空间孤子:Spatial soliton | 孤立子解:Soliton solution

solution domain：解空间

作为一个OO编成语言,C++允许你对问题域本身建模,这就允许你在问题域语言中编程而不是在解空间(solution domain)编程. C++并没有试图让差的程序员能够避免写出差的程序;它允许明理(reasonable)的开发者写出出众的软件.

solution set of equation：方程的解集

solution formula 解公式 | solution set of equation 方程的解集 | solution space 解空间

Loesungsmenge solution set：解集

Loesung solution 解 | Loesungsmenge solution set 解集 | Loesungsraum space of solutions 解空间

solution space：解空间

为了实现回溯,首先需要为问题定义一个解空间( solution space),这个空间必须至少包含问题的一个解(可能是最优的). 在迷宫老鼠问题中,我们可以定义一个包含从...

Solves the space：解空间

solves the vector 解向量 | Solves the space 解空间 | sort 排序

solves the vector：解向量

solution 解 | solves the vector 解向量 | Solves the space 解空间