|
关注：1
2013-05-23 12:21
求翻译：The offline problem is defined in terms of n bins B and each bin b ∈ B has a capacity Cb. It receives as input a set R of requests. Each request is typically characterized by its capacity and its reward, which may or may not depend on which bin the request is allocated to.The goal is to find an assignment of a subset T是什么意思？ 待解决
 悬赏分：1
- 离问题结束还有
The offline problem is defined in terms of n bins B and each bin b ∈ B has a capacity Cb. It receives as input a set R of requests. Each request is typically characterized by its capacity and its reward, which may or may not depend on which bin the request is allocated to.The goal is to find an assignment of a subset T
问题补充： |
|
2013-05-23 12:21:38
离线问题是定义在n个垃圾箱b表示每个纸槽B∈B有能力可换股债券。它接收作为输入的请求的一个集合R。每个请求的典型特征是其容量和奖励，其可能或可能不依赖于该bin中的请求被分配to.the目标是寻找到满足所述分区中的请求的一个子集吨⊆R一种分配特定问题的约束和最大化的目标函数。
|
|
2013-05-23 12:23:18
正在翻译，请等待...
|
|
2013-05-23 12:24:58
正在翻译，请等待...
|
|
2013-05-23 12:26:38
正在翻译，请等待...
|
|
2013-05-23 12:28:18
脱机问题就 n 而言被定义贮藏 B 和每个箱子 b？B 有一产量的 Cb。收到作为输入请求的一套的 R。每请求通常被其能力和不一定取决于请求哪个箱子被分配的其奖赏描绘 to.The 目标是发现一个子集的一项任务 T？到满足问题特定的约束，将客观功能最大化的箱子的请求的 R。
|
湖北省互联网违法和不良信息举报平台 | 网上有害信息举报专区 | 电信诈骗举报专区 | 涉历史虚无主义有害信息举报专区 | 涉企侵权举报专区
