第一节组合最优化的基本概念 2.1.t组合最优化问题 组合最优化问题(Combinatorial Optimization)是通过对数学方法的研究去寻找 离散事件的最优编排、分组、次序或筛选等。
基于20个网页-相关网页
...规划的求解技术可分为: 1,约束满意问题(Constraint Satisfaction Problems) 2,约束最优化问题(Constraint Optimization Problems) 3,超约束问题(Over-Constrained Problems) 4,约束解题(Constraint Solving) 4.13.1约束满意问题 约束满意问题可定义为:一组变数...
基于20个网页-相关网页
...,改变各控制器的设定值,以使过程状态发生变化后能达到某种目标函数的最优,这是动态优化问题(dynamic optimization problems)。
基于12个网页-相关网页
...法,选择保留过去搜寻的经验及记忆,以避免重复循环地搜寻作业,及陷入局部最小值 4.13.5 约束最优化问题(Constraint Optimization) 约束最优化问题包含一组标准约束满意问题及一个最优化目标函数,将所有的解标示成一个函数数值.
基于8个网页-相关网页
最佳化问题 optimization problem
最优化问题 optimalization problem ; optimization
消化问题 Digestive Problems
优化问题 optimization ; DCOP ; combinatorial optimization
老龄化问题 the aging problem ; the problem of aging ; Ageing Problems
组合最优化问题 combinatorial optimization problem ; combinatorial problem
组合优化问题 combinatorial optimization problem
多目标优化问题 multiobjective optimization problem ; MOOP ; M O PS
离散最优化问题 discrete optimization problem
她直言不讳地评论过大麻合法化问题。
She has made outspoken remarks about the legalization of marijuana.
我们已经讨论了私有化问题,但不想采用这种方法。
We have discussed privatization, but we would prefer not to go down that particular road.
我们的政府正在寻求一些方法,包括用于应对人口老龄化问题的三胎政策。
Our government is looking for some ways, including the 3-child policy to deal with the problem of aging population.
But in terms of SI units, which become much more useful if you're actually trying to use intensity in a problem and cancel out your units, we're just talking about joules per second is what intensity is.
但是用国际单位制,这个变得越来越有用了,如果你实际上在使用强度,来解决问题和约化单位,我们仅仅讨论每秒钟的焦耳,这就是强度。
In binary search-- ah, there's that wonderful phrase, this is called a version of binary search just like you saw bin-- or bi-section methods, - when we were doing numerical things- in binary search, I need to keep track of the starting point and the ending point of the list I'm looking at.
就是当我们处理数字的时候,所称的二分检索,在二分法搜索中,我需要记录区间的开始点和尾点,初始化的时候就是-,问题输入的开始点和尾点,当我开始做测试的时候,我想要做的就是去取中值点。
应用推荐