问题分解

为提高工作流授权合理性验证的效率，增强对执行时任务指派的支持，提出了基于问题分解的工作流授权合理性验证方法。

In order to improve the verification efficiency of Workflow Authorization Reasonability ( WAR ) and enhance supporting task assignment at operation time , the WAR verification method based on problem decomposition was proposed .

根据UC约束特点将机组组合问题分解为单机多时段和多机单时段问题。

This paper treats UC as a two-phase problem : single unit for multiple periods and multi-unit for single period .

用Lagrangian松弛法将问题分解为多个子系统，对协调级建议一种灵敏系数法代替常规的次梯度法、速度快适应性好；

A sensitivity coefficient coordination algorithm between two levels for Lagrangian relaxation method is proposed instead of conventional subgradient algorithm .

本文提出一种基于复杂问题分解的布尔函数极小化方法SWT3。

This paper presents a complicated problem decomposition-based approach called SWT , to the Boolean function minimization .

具体来讲，BPM是一种构建操作解决方案的方法，而SOA是一种思维模型，帮助将复杂的问题分解为定义良好且可重用的组件。

Specifically , BPM is a way of building operational solutions and SOA is a thought model that helps decompose complex problems into well-defined and reusable components .

在此基础上，采用改进模糊C均值算法自适应构造多种群算法结构，并结合信赖域方法调整搜索空间，将大规模参数优化问题分解为多个子问题进行协同寻优和信息共享。

On this basis , combined with trust region methods , the modified fuzzy C-means algorithm is adopted to construct multi-group structure , and to decompose the large-scale parameter optimization problem into sub-problems . Each group collaborative optimizes and shares the information .

这种模型用规划方法将整个设计问题分解成由各种设计对象组成的类等级层次结构，能方便地将人类（专家）的设计知识和经验融入到CAD系统之中。

With this model , a design problem can be treated as a class structure that consists of different design objects , and is capable of putting the design knowledge and human ( experts ) experience into the CAD system conveniently .

在这一数学模型的基础上，把团队组织问题分解为一系列相互独立的子问题，并提出了一个基于Tabu搜索的算法来解决此子问题。

Based on this mathematical model , the team organization problem is decomposed into a series of independent sub-problems . And a Tabu search-based algorithm is proposed to solve the sub-problems .

MapReduce在映射阶段将一个问题分解为数百万个并行计算，并生成键-值对流作为输出。

MapReduce breaks down a problem into millions of parallel computations in the Map phase , producing as its output a stream of key-value pairs .

把整个电网拓扑分析问题分解为若干个基本分析单元，提出了基本分析单元的有色Petri网模型，用令牌表示母线，用令牌的颜色表示连接在同一母线上的结点。

The topology analysis is decomposed into many units , each of which is modeled with a coloured Petri net , where a token represents a bus , and the token color represents the nodes connected to the bus .

OEASAT将SAT问题分解成若干子问题，然后用每个子问题形成一个组织，并根据SAT问题的特点设计了三种组织进化算子&自学习算子、吞并算子和分裂算子以引导组织的进化。

Three new evolutionary operators , the self-learning operator , the annexing operator and the splitting operator , are designed with the intrinsic properties of SAT problems in mind . Furthermore , all organizations are divided into two populations according to their fitness .

基于动态规划的QOS感知缓存部署算法首先保证请求的QoS要求被满足，在此基础上，将缓存部署问题分解成一系列的子问题，然后利用动态规划算法求出最优缓存部署。

The dynamic programming algorithm first to ensure the requested QoS requirements are met , on this basis , the cache deployment problem is decomposed into a series of sub-problems , and then use dynamic programming algorithm to find the optimal cache deployment .

实验结果证明，二叉树构造多类框架将指纹多类分类问题分解成3个二类分类器系统，不仅可以有效的提高指纹分类的效率，还充分发挥了SVM分类器解决二类分类问题的优势。

Experimental results show that the fingerprint multi-class problem is divided into three 2-class classifier system by using binary tree to construct the multi-class frame , which not only can improve the efficiency of fingerprint classification but also exerts the superiorities of SVM classifier for two-class classification problem sufficiently .

AOP的目标是通过把问题分解成一系列功能模块和一系列贯穿多个功能模块的方面，然后再通过工具自动化的重新组织这些模块和方面，以获得系统的实现。

The purpose of Aspect-Oriented Programming ( AOP ) is to divide the problem automatically reassembled into a series of function models and aspects crossing many function models by a reorganization of these tools the models and aspects into a whole program .

算法把原问题分解为一系列子问题，在保持原问题的Wolfe对偶可行的前提下，通过迭代计算，由这一系列子问题的最优解向原问题的最优解逼近。

The original problem is divided into a series of subproblems in the method . In the condition of Wolfe dual problem is feasible , the optimum solution is obtained by solving the subproblems through iterations .

采用Benders分解法可以将这个高维度、非线性、混合整数随机规划问题分解为主问题和子问题求解：主问题是一个多目标整数规划问题，而子问题则是一个非线性随机问题。

The Benders decomposition method can divide this large scale , non-linear , mixed-integer stochastic programming problem into two problems : a deterministic multi-objective integer programming master problem and a stochastic , non-linear operation sub-problem .

文中以最优潮流为基础，采用Benders分解方法将考虑静态安全约束的ATC计算问题分解为一个基态主问题和一系列与各预想事故有关的子问题。

In this paper , Benders decomposition method , based on Optimal Power Flow ( OPF ), is proposed to partition the static security constrained ATC problem into a base-case master problem and a series of subproblems relevant to various contingencies .

为了便于求解，根据不同时间粒度对基本数学模型进行递阶分解，将多UCAV协同任务规划问题分解为任务调度和航迹规划两个子问题，分别求解UCAV任务计划和航迹计划。

By decomposing the basic mathematic model according to different time granularity , the multi-UCAV cooperative mission planning problem is devided into two subproblems for solving the task plan and path plan respectively , which are called task scheduling and path planning .

将原问题分解成两个子问题，并分别求得杆中的弹性场；

The original problem is devided into two sub - problems .

基于问题分解的蚁群算法在半导体晶圆制造调度中的应用

Decomposition Based Ant Colony Optimization Algorithm Applied to Semiconductor Wafer Fabrication System

在将集装箱预翻箱问题分解的基础上，采用混合优化策略来实现集装箱预翻箱方案。

The hybrid optimization strategy is applied to facilitate the turning-box plan .

试着把这个问题分解成独立的几个部分。

Try breaking the problem down into its separate components .

它将原问题分解为一系列相互独立的子问题。

The original problem is partitioned into a series of independent subproblems .

你可以把这个问题分解为两部分。

You could break it down into two parts .

一类大系统目标规划问题分解算法中最优解之间的关系

The Criteria of Optimal Solution on A Kind of Large Scale Goal Programming

同样，我们需要将问题分解成易于掌握的较小部分。

Again , the need is to unpack the problem into manageable pieces .

我们应该把问题分解成简单的要素。

We should resolve the problem into simple elements .

能够把一个问题分解成为若干个子问题。

Be able to reduce a problem into a set of easier sub-problems .

基于模型的诊断问题分解及其算法

The Decomposition for Model-Based Diagnosis Problem and Its Algorithm

该算法利用分支定界的思想将原问题分解为多个子问题来获得最优解。

The algorithm branch the original problem to many sub-problems to get optimal solution .