|
关注：1
2013-05-23 12:21
求翻译：Although such a lookup overhead can be achieved only if the tasks are structured with a balanced tree with k children at each intermediate node, it serves as a reasonable approximation of the achievable effort reduction.是什么意思？ 待解决
 悬赏分：1
- 离问题结束还有
Although such a lookup overhead can be achieved only if the tasks are structured with a balanced tree with k children at each intermediate node, it serves as a reasonable approximation of the achievable effort reduction.
问题补充： |
|
2013-05-23 12:21:38
虽然这样的查找开销可以仅实现，如果该任务被构造有具有k孩子平衡树在每个中间节点，它作为可实现的努力减少一个合理的近似。
|
|
2013-05-23 12:23:18
正在翻译，请等待...
|
|
2013-05-23 12:24:58
虽然这样查寻天花板可以达到，只有当任务构造与一棵平衡的树与k孩子在每个中间结，它担当可达成的努力减少的合理的略计。
|
|
2013-05-23 12:26:38
虽然只有任务的结构与患儿 k 时在每个中间节点的平衡树，可以实现这种查找的开销，它作为实现努力减少合理近似值。
|
|
2013-05-23 12:28:18
正在翻译，请等待...
|
湖北省互联网违法和不良信息举报平台 | 网上有害信息举报专区 | 电信诈骗举报专区 | 涉历史虚无主义有害信息举报专区 | 涉企侵权举报专区
