文中着重研究构建最小延迟应用层组播树的算法，提出一种基于策略函数构造应用层最小直径组播树的启发式算法BCT - H。

Focuses on the algorithms of the minimum-delay spanning tree for the application-layer multicast, and proposes an improved BCT-H (balance compact tree-heuristic) algorithms based on strategy function.

youdao

它能够满足报价服务、转换函数和策略、支付方法和用户识别等功能性需求。

It addresses functional requirements such as quote services, conversion functions and policies, payment methods, and user identification concerns.

youdao

该函数根据预定义的策略验证操作能否继续进行。

This function validates that the operation may proceed based on the predefined policies.

youdao

Identify the best responses of each player as a function of the others and find out where they intersect.

把每个人的最佳对策看成别人策略的函数,然后找出函数的交点

耶鲁公开课 - 博弈论课程节选

So this is going to be the choice of Player 1, and this is going to be the choice of Player 2, and what I want to do is I want to figure out what this looks like.

这个表示参与人1的策略,这个表示参与人2的策略,接下来我想要知道,这个函数究竟是什么样子的

耶鲁公开课 - 博弈论课程节选

What will Player II's best response look like as a function of Player I's choice in the same picture?

在同一个图像里面怎么表示,参与人II的最佳对策是I策略的函数

耶鲁公开课 - 博弈论课程节选