问题求解

词组短语

problem solving

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

Basing on the Graf′s addition theorem, two expessions, interior and exterior expression, are deduced and the suitable problems for them are discussed. It has been found that the interior expression is the main point for sovling the scattering problem of circular inclusion in half-space. It also has been found that the exterior expression is the key for the scattering problem of circular arc canyon and circular arc alluvial valley, and is one of the main points for scattering problem of circular arc hill as well.

从Graf原有加法公式出发，本文给出了其内域型和外域型两种表达形式并讨论了这两种表达的适用范围，同时指出：内域型表达是求解半空间内含夹塞区出平面散射问题的要点，而外域型表达是解决任意圆弧型凹陷地形和任意圆弧型沉积盆地出平面散射问题中求解难点的关键，同时也是克服任意圆弧型凸起地形出平面散射问题求解困难的要点之一。

Optimization solution algorithm is the most important in topology optimization.Algorithms fit for discrete structure and continuum structure are all investigated. Thecharacteristic and different using limit of both optimization criteria method andmathematics programming method are all analyzed in this paper. OC algorithm and theseries MMA algorithm based on SIMP approach are deducedand used for the topology optimization problem of continuum structure.

优化求解算法是拓扑优化问题求解的核心和关键，本文系统分析了适用于离散结构和连续体结构优化的优化求解算法，重点讨论了 OC 算法和 MP 算法，分析比较了不同算法的特点和适用范围，推导了基于 SIMP 理论的优化准则法和 MMA 系列算法，并将MMA 系列算法应用于连续体结构拓扑优化问题的求解。

Thecharacteristic and different using limit of both optimization criteria method andmathematics programming method are all analyzed in this paper. OC algorithm and theseries MMA algorithm based on SIMP approach are deducedand used for the topology optimization problem of continuum structure. MMA algorithm hasa bad convergence but it has a high computational efficiency, while GCMMA is excellent onconvergence and stability with bad calculation efficiency.

优化求解算法是拓扑优化问题求解的核心和关键，本文系统分析了适用于离散结构和连续体结构优化的优化求解算法，重点讨论了 OC 算法和 MP 算法，分析比较了不同算法的特点和适用范围，推导了基于 SIMP 理论的优化准则法和 MMA 系列算法，并将MMA 系列算法应用于连续体结构拓扑优化问题的求解。

CBFEC emphasizes direct correspondence of concepts in EC with its software architecture for ease of understanding and using; minimal coupling with specific problem structure for easy adaptation it to solve a large number of wholly different problems; interface-centered design for extendibility. To achieve those objects, the problem-solving method of EC is analyzed and the problem-solving procedure of EC is divided into three interactive aspects: population-based stochastic searching mechanism, problem specific information to implicitly guide the stochastic searching, and the observation and control of the computation procedure of EC. Then the key concepts of EC are identified in those three aspects; the normal implementations of those concepts are summarized; the interfaces represents those concepts in software are abstracted; the collaborations of components through those interfaces are designed. CBFEC is implemented on mainstream component software platform COM/DCOM (Component Object Model/Distributed COM from Microsoft), which includes interfaces definitions, commonly using EC components implemented those interfaces, such as Simply EA component, Steady State EA component, EA component, EA component, Population component, Tournament Selection component, Linear Ranking Selection component, Nonlinear Ranking Selection component, Random Number Generator component, etc, and the collaborations of those components through those interfaces.

具体的做法是把演化计算看作是基于组件的软件工程的一个应用领域：首先分析了演化计算求解问题的一般思路和方法，把演化计算问题求解过程分为："设计基于群体的随机搜索机制"、"研究问题的性质并以此隐含地定义算法的搜索方向"和"求解过程的观察与控制"三个部分；然后分别找出各个部分中的关键概念，总结这些概念现有的一般实现方法，抽取其本质，以此结合设计模式来定义组件软件的接口；通过分析演化计算各个概念之间的相互联系来设计组件软件间通过接口的进行交互的方式；最后还在目前一种主流组件软件开发平台COM／DCOM（微软提出的组件对象模型）的基础上实现了常用的演化计算组件，如简单演化算法组件、稳态演化算法组件、演化算法组件、演化算法组件、种群组件、锦标赛选择策略组件、线性排名选择策略组件、非线性排名选择策略组件、随机数发生器组件等等。

The paper gives a special discussion of regularization method in inverse problem. On this basis, an ideal solution for ill-posed problem is built-the best disturbed iteration.

论述了反问题的高度非线性及求解的不适定性，分析了反问题求解的各种方法，并对在反问题求解过程中经常遇到的一类离散不适定问题进行了详细地分析和研究，并给出了具体的算法。

The paper contains four parts. In the first chapter, the application back ground and the main algorithms of the complementarity problems is introduced. In Chapter 2, some basic definitions and theories of complementarity problems are introduced. The 3rd chapter is the most important part of this paper, in which a modified smoothing Newton method is detailed; also the global convergence is established for the method.

全文共分为四章，各部分内容安排如下：第一章是绪论部分，介绍了互补问题的应用背景和近年来有关互补问题求解方法的研究成果；第二章是预备知识，介绍了与求解互补问题有关的一些定义以及相关的定理和推论；第三章是本文的重点，提出了求解互补问题的一种修正的光滑Newton算法，从理论上对算法的全局收敛性了证明；第四章是这种修正的光滑Newton法用于求解广义非线性互补问题中，同样证明了算法的全局收敛性。

A fine-grained genetic algorithm based algorithm which is for the parameters optimization problem of agent model is proposed. The fine-grained genetic algorithm is used to solve the parameters optimization problem of agent model. As to the parameters optimization problem of the agents colony model, the first step is to define the concept of "the parameters mode of the combat agents colony" to describe the parameters of the combat agent colony model. Then the genetic algorithm is used to solve the optimization problem with the parameters mode of the combat agent colony model as the genetic individual. Besides the algorithm, the algorithm dispatch tactic is also considered. And the two level sequence dispatch tactic and the two level nesting dispatch tactic are put forward for those complex parameters optimization problem. At last, the model parameters optimization under antagonism codition is studied. The means to solve this problem is to translate it into a kind of antagonism problem, then use the competitive co-evolutionary genetic algorithms to solve it.

其中：提出了一种基于细粒度模型的作战智能体模型参数优化求解算法，用细粒度模型遗传算法求解作战智能体模型参数优化问题；提出了"作战智能体群体参数模式"的概念，对作战智能体群体模型参数进行形式化描述，再以作战智能体群体参数模式为遗传个体，应用遗传算法求解作战智能体群体模型参数的优化问题；研究了上述优化问题求解算法的调度策略，提出了分层模型参数优化算法的双层顺序调度策略和双层嵌套调度策略，解决复杂的模型参数优化问题；将对抗条件下作战模型参数的优化问题转化为一种对抗性问题，应用竞争性共同进化遗传算法，进行求解。

A user interface for CPES-V language has been designed, which is a parallel expert system tool language V language is convenient for user, simple and clear in expression. It integrates blackboard discription, knowledge_source discription and problem solving model discription in one entity.

本文为CPES设计了一种使用方便、表达简洁的用户界面——V语言，V语言是一种并行专家系统工具语言，它集黑板问题求解过程中的黑板描述、知识源描述、问题求解模型描述为一体，大大缩短了用户使用黑板模型进行问题求解试验的周期，本文还讨论了使用V语言进行问题求解的一些具体问题，如任务分配问题、存贮容量分配问题、问题求解步骤等。

Meanwhile, the method of how to learn macro-operator based on subgoals is also studied. Secondly, the situation of problem solving, in which there are no problem operator model and no any heuristics, is studied.

其次，作者针对无问题操作模型同时也无问题求解启发式信息的情况，研究如何利用训练例子，不断进行问题求解的试探，自动获取操作在不同状态集中的效用信息，形成问题求解的初步规划。

Firstly, the situation of problem solving, in which there is problem operator's model but no any heuristics, is studied. The utilities of operators applied in set of states can be obtained through the analysis of operator model, and the problem planning can be makeup in the form of subgoal hierarchic.

首先，作者针对有操作模型但无问题求解启发式信息的问题，研究如何通过自动分析操作模型获取操作在不同状态集中的效用，形成问题求解的初步规划，并利用初步规划的结果逐步求解相关子问题，从而获得整个问题的解。

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

Combinatorial Problems：组合问题

模拟退火方法在组合问题(combinatorial problems)的求解方面,相当管用. 组合问题是不同选择的排列组合,一个有名的例子是旅行推销员问题(traveling salesman problem, TSP):旅行推销员问题的计算复杂度(computational complexity)可以简单说明如下:它又和其他的人工智慧方法有所关联(系列之后会谈);

fundamental matrix：基础矩阵

通过解决给定的二次规划问题求解同形矩阵,提高了算法的鲁棒性,然后利用平面约束求解内参数,最后通过本质矩阵(Essential matrix)和基础矩阵(Fundamental matrix)之间的关系以及旋转矩阵的性质求解相机外参数.本文最后给出的实验结果表明,

optimization problem：最优化问题

本章及后续章节中的许多例子都是最优化问题(optimization problem),每个最优化问题都包含一组限制条件(constraint)和一个优化函数(optimization function),符合限制条件的问题求解方案称为可行解( feasible solution),

problem solving：问题求解

在做原因...问题求解(Problem Solving)主要考查应试人最基本的算术、代数、平面几何、解析几何和图表等方面的基础知识和庆用能力. 问题求解部分一般是以商业经济或现实生活为背景,以日常会话的形式出现的. 考生在做问题求解时,应注意以下几方面...

problem reformulation：问题重组

problem programmer 解题程序员 | problem reformulation 问题重组 | problem solving knowledge 问题求解知识

Scheduling problem：调度问题

有效地解决了机器人定位这一非线性非高斯状态估计问题.模拟退火算法的应用很广泛,可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等.

solve：求解

本人正在建一个上覆地层(分三层)为软岩的浅埋暗挖隧道模型,按照FLAC3D求解问题的思路,应该在初始化完地应力且开挖之前对模型求解(solve)直至平衡,然后将三个方向的位移归零后再进行开挖和相应支护.

DAL：数据访问语言

通过对目前面向问题求解的决策支持系统中数据访问机制的研究,设计了一种数据访问语言(DAL)及其解释模型,从而通过在数据需求和数据存储之间添加数据语义层,提供了统一的数据访问接口,提高了决策问题求解的有效性和EUD模式的可行性.

Evolutionary Algorithms：进化计算

详细说明:JavaEA是一个用Java编写的基于进化计算(Evolutionary Algorithms)的随机二元约束满足问题求解器,作者提供了多个进化计算方法求解随机二元约束满足问题.

problem solving knowledge：问题求解知识

problem reformulation 问题重组 | problem solving knowledge 问题求解知识 | problem state 解题状态