查询词典 queuing problem
- 与 queuing problem 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
The two cases demonstrate 'Feudal Paternalistic Bureaucracy Culture,' which shows that the organizations have their own relevant problems and impacts on members' health; GN Company has the problem of insufficient integration in organizational culture, and ABC College has the problem of the incongruence between the espoused values and basic assumptions.
接著本研究透过二个组织个案,具体讨论几种「健康组织」之观点是否可在现象场中采用,并更细致的探讨与推衍各观点的意涵,以及各自对组织与其成员之健康的影响。
-
In the paper, a modified Similarity Measure Function, called Dsim, is proposed in order to solve the problem of non-contrasting behavior high dimensional space, and then a learning algorithm, called DCFCM, is advanced through the combination of Dsim and Approximated K-median and applied in intrusion detection which solves the problem of sharp border effecting problems and realizes the detection of abnormal incurrence.
本文将首先提出新的相似度函数Dsim,有效地解决了高维空间聚类选维和降维问题,实现了高效的聚类了;接着将Dsim与近似K-medians算法相结合,提出了新的模糊聚类算法----DCFCM,并将其用于入侵检测。解决了由尖锐边界、孤立点所带来的误报警和漏报警问题,实现了对异常行为的检测。
-
Becasuse planning problem itself is a very hard problem to be solved and there are many indeterminacy factors.
虽然人们研究规划问题已经有近五十年了,而且也已经提出了各种各样的解决方案,但随着智能规划从理论研究逐渐向应用研究的发展,人们发现经典的规划根本无法满足实际应用的要求,因为规划问题本身就是一个非常难解决的问题,而在实际应用中又具有许多不确定的因素。
-
By introducing the selective identity and selective chosen message attack model, this paper proved unforgeability of the scheme under the hardness of DHI problem and its indistinguishability against selective identity and chosen ciphertext attack under the hardness of DBDHE problem.
通过引入了选择身份和选择消息攻击的安全模型,利用DHI问题的困难性,证明了方案的不可伪造性,同时利用DBDHE问题的困难性,证明了方案在选择身份和选择密文攻击下的不可区分性。
-
The other classfies the calculation of MBPS into the solution of inequation based on heuristic knowledge of MBPS of optimal directional coordination setting in complex multiloop network and comes into equivalence of 0-1 integral second layout problem. On the basis of the principle of Gene Optimal Evolution, a new approach to determine MBPS is first presented and decreases the computational complexity of MBPS problem.
其二,利用复杂环网方向保护最优整定配合中最小断点集的启发知识,将MBPS的计算归结为解不等式,进而等价为0—1整数二次规划问题,基于基因遗传优化计算原理,首次提出了MBPS问题的基因遗传算法,降低了问题的计算复杂性。
-
You can talk about your biggest problem being inertia and how you're going to solve that problem.
你可以说说你最大的问题是客户的使用习惯,以及你如何解决这个问题。
-
This problem is one falls in individual quadrant forever it seems that, carry the difficult problem with limited fund and finite inextricability wisdom.
这个问题似乎永远是一个在个人象限下,通过有限资金和有限聪明无法解决的难题。
-
ABSTRACT The infeasibility problem in voltage/reactive power optimization is analyzed in this paper, and this problem is handled with fuzzy constraints to obtain a solution as close as possible to the original space.
分析了电力系统电压无功实时优化控制中出现的不可行问题,通过引入模糊约束,从一个新的角度对不可行问题进行了处理,最终获得尽量靠近原不等式约束空间的解。
-
Chapter 4,based on strong efficiency rather than efficiency or weak effi-ciency,discusses the similar problem to chapter 3.The concepts of strongsupremum and strong infimum for the set in finite-dimensionalEuclidean space are given,s-conjugate functions and s-subdifferentials theory is developed,by means of which,the duality problem ofmulitobjectivre programming for strong efficient solutions or called absoluteoptimal solutions is analysed,and a new duality theory-s-conjugateduality theory is proposed.
第四章,基于强有效性而不是有效性和弱有效性,给出了类似于第三章的结果,提出了有限维欧氏空间中集合的强上、下确界等概念,研究了点集映象的强共轭函数和强次微分问题,建立了点集映象的s-共轭函数及其s-次微分理论,并借助于这一理论,讨论了多目标规划关于绝对最优解或称强有效解的对偶性问题,建立了基于强有效性的s-共轭对偶理论。
-
The infinite dimensional inverse problem was approximated by a problem in the finite dimensional space by using approximation theory.
将该算法应用于复杂函数的自动演化建模,也取得了理想的效果,因此该算法具有良好的通用性。
- 相关中文对照歌词
- Problems
- You Got A Problem
- Problem
- Problems
- Problem
- Problem Child
- Problem
- Sucker
- No Problem
- Johnny's Gotta Problem
- 推荐网络例句
-
Chimborazo and Cotopaxi, took me by the hand.
越过琴博腊索山和科托帕克西山。
-
This car is in a good condition.
这辆车的状况很好。
-
You can divide them into two categories.
您可以分为两类他们。