首页> 外国专利> RESOURCE ALLOCATION METHOD BASED ON BARGAINING SOLUTIONS USING CONVEX OPTIMIZATION WITH LINEAR CONSTRAINTS

RESOURCE ALLOCATION METHOD BASED ON BARGAINING SOLUTIONS USING CONVEX OPTIMIZATION WITH LINEAR CONSTRAINTS

机译:基于线性约束凸优化的讨价还价的资源分配方法

摘要

The present invention relates to a resource allocation method based on a negotiation solution method using a convex optimization method with a linear constraint. In order to efficiently distribute resources on a network among multiple multimedia users, By applying the negotiation solution using the convex optimization technique based on the redefined utility function, it is possible to perform efficient resource allocation for a large amount of resources and a large number of users.;
机译:本发明涉及基于使用具有线性约束的凸优化方法的协商解决方法的资源分配方法。为了在多个多媒体用户之间有效地在网络上分配资源,通过使用基于重新定义的效用函数的凸优化技术的协商解决方案,可以对大量资源和大量资源进行有效的资源分配。用户。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号