Now, the strategy here is pretty clear. As often is for the continuous problem. What's the strategy? I pour in the gold till I run out of gold.
现在我们的战略已经很明显了,对连续性问题战略是怎么样的?,我先把所有金子,装进去。
with the continuous knapsack problem as we've formulated it, greedy is good.
因为正如我们已经归越过的,对于一般连续性背包问题贪婪算法很实用。
There's also the question of continuity.
还有一个连续性的问题
But it is in fact indicative of what's actually going on underneath the hood and for a forensic investigator to be honest and even problem set 5, it poses a potential wrinkle if those JPEGs, those photos we took are not contiguous back to back to back but are all over the place.
但是实际上就像那些法医调查员,所做的实质说明,其实对套题5也是如此,如果那些JPEG文件有问题,我们将其数据不能连续的,放回原来的地方,那么图像会呈现出波纹形状。
Problem is here, that Player II has a continuum of strategies and trying to draw all possible probabilities over an infinite number of objects on the board is more than my drawing can do. Too hard.
现在问题是,参与人II的策略是连续的,想要把无限可能性的概率,做成图都画在黑板上,是不可能的了
Typically up till now, we've looked at things that can be done in sublinear time. Or, at worst, polynomial time. We'll now look at a problem that does not fall into that. And we'll start with what's called the continuous knapsack problem.
至今为止我们已经处理过,亚线性问题,最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。
应用推荐