组合问题

  • 网络Combination;combinatorics;Combination problems;combinatorial problems
组合问题组合问题
  1. 一类资源组合问题的扩展参数Petri网建模与优化研究

    Modeling and optimization of a type of resource combination problems using expanded parameter Petri net

  2. 基于入侵检测的神经网络分类器组合问题及PCA技术研究

    Research on Neural Network Classifiers Combination and the Principal Components Analysis of Intrusion Detection

  3. 具有时间约束的机组组合问题中的Petri网模型

    Petri-Net Model in Unit Commitment Problem with Time Constraints

  4. 应用MAS解决基于利润的机组组合问题研究

    Study of profit-based unit commitment with multi-agent system

  5. 以有限状态自动机模型形式化地定义了业务流程的外模式和内模式,将Web服务组合问题转化为有限状态自动机问题。

    The inner and outer schema of business process are formally defined based on FSM . Thus the problem of Web services composition is transformed to the problem of FSM .

  6. 机组组合问题(UC)是高维、非凸、多约束的混合整数规划问题。

    Unit Commitment ( UC ) is a high-dimensional , non-convex , multi-constraint mixed integer programming problem .

  7. 其次介绍了时序Petri网,引用了时序Petri网(TemporalPetriNet,TPN)模型,利用时序Petri网来描述Web服务组合问题。

    Followed by the introduction of temporal Petri net , quoting temporal Petri net model , and use temporal Petri net to describe web services composition problem .

  8. 作为近期发展起来的一种随机搜索方法,tabu搜索法有较强的解决复杂组合问题的能力。

    As a newly developed random search method , TABU method has strong ability to solve complex combined problem .

  9. 由于预方法将冲突化解为不确定的知识表示,D-S理论可以处理冲突证据的组合问题。

    Therefore D-S theory can deal with the cases with highly conflict evidences since conflict information is translated into unknown knowledge .

  10. 在这一趋势下,传统的约束满足求解方法已经不能适应分布式的组合问题求解,特别是对自治Agent间需要协商求解的多Agent系统更是无法应用。

    In this trend , the traditional centralized constraint satisfaction algorithms can not cope with the solving of the distributed combinatorial problems ; especially , it can not be applied in the multi-agent systems that need negotiatory solving between autonomous agents .

  11. 采用智能型与并行性的遗传算法是一种有效解决NP完全组合问题的方法,适合在排课系统中应用。

    Genetic algorithm with intelligence and parallel technique is an effective method to solve the complete NP coupling problem and is suitable to be used in the course arrangement system .

  12. 这就是经典的集合覆盖问题(SCP)。它是NP-hard类的最优化组合问题。

    This is the classic Set Cover Problem ( SCP ), which is also one of NP-Hard combinatorial optimization problems and one of the most well-studied problems .

  13. 在初步探讨各种事件检测技术的组合问题的皋础上,为解决高速公路事件检测技术信息融合问题,将D-S证据理论引入到事件检测领域,并建立一种高速公路事件检测技术信息融合D-S方法。

    Based on combination of incident technologies , in order to resolve incident detection technology information fusion problems , an information fusion D-S method of incident detection technology is established .

  14. 遗传算法是一种借鉴于生物界自然选择和进化机制发展起来的高度并行、自适应的随机搜索算法,是一种非常有效的解决NP完全的组合问题的方法。

    Genetic Algorithm is a high-effective Paralleling Processing , randomly searching and self-applicable algorithm based on the development of the nature evolution and option , it is a very effective algorithm to resolve NP-Completed Combination Optimization Problem .

  15. 相比较而言,基于小世界网络的PSO算法具有更好的寻优能力,而基于无标度网络的PSO算法则具有更高的收敛速度,在解决机组优化组合问题中具有一定的可行性和有效性。

    In comparison , the PSO algorithm with small-world network has a better optimization ability , the PSO algorithm with scale-free network has a higher convergence rate , they has the feasibility to solve the unit commitment optimization effectiveness .

  16. 利用CC-PN建立机组组合问题中时间约束辅助模型

    Using cc-pn to model time-dependent constraints for unit commitment problem

  17. 本文应用一种新型的智能算法-PSO算法求解有约束的最优投资组合问题,并讨论了最优解的质量与PSO算法中一些重要参数的关系,给出了参数选取的一些建议。

    A new intelligent approach called PSO is applied to solve the optimal portfolio model with constraints . The relation between the quality of the solution and the parameters of PSO method is discussed , and the selection of proper parameters is proposed .

  18. 本文针对目标综合识别中冲突信息的组合问题,以Dempster组合规则为基础,提出了一种基于均衡信度分配准则的冲突证据组合方法;

    Within the framework of Dempster Shafer theory of evidence , a combination rule based on proportional belief assignment is presented in order to solve conflict evidence combination in identification fusion .

  19. 在风险资产服从Stein-Stein模型的假设下,研究了幂效用函数的最优投资组合问题。

    Under the assumption that the traded asset follows the Stein-Stein model , this paper studies the optimal portfolio problem with a power utility function .

  20. 公积金贷款与商业性贷款的组合问题。

    The combination of the accumulation fund loan and commercialized loan .

  21. 闽江下游洪潮遭遇组合问题的探讨

    On Combinations of Flood-Tide Encounter at Lower Reaches of Min River

  22. 一类解析函数族及其α阶组合问题

    A Class of Analytic Function and α order Combination Problem

  23. 摩擦市场上允许买空卖空的投资组合问题

    The Portfolio Selection Problem in Frictional Market Allowing Short Sale

  24. 针对决策级信息融合中的冲突证据组合问题进行了深入的研究。

    An intensive research on the combination method of conflict evidence is made .

  25. 合作讨论和元认知监控与排列组合问题的解决

    Inter-relations among Collaborative Discussion , Meta-cognitive Control and Successful Solution in Combinatorial Problem

  26. 一类投资优化组合问题的建模及基于遗传算法的求解

    Modeling of a Class of Portfolio Problem and Solving Based on Genetic Algorithm

  27. 无向环网的一个组合问题

    A Combinatorial Problem related to Nonoriented Double Loop Networks

  28. 一种求解最优机组组合问题的随机扰动蚁群优化算法

    An ant colony optimization algorithm with random perturbation behavior for unit commitment problem

  29. 投资组合问题的动态规划方法

    A Dynamic Programming Method for the Portfolio Problem

  30. 一类逆组合问题的并行优化

    Parallel Optimization of a Kind of Anti-construction Problem