I think that's really something that happens to a lot of students in all different ways, really coming to grips with.
我想,这也正是现在,很多同学遇到的问题,也都在尽力解决这种事。
I think that would help solve a lot of the medical difficulties that people have these days.
我认为这种办法可以帮助解决现在困扰人们的许多医学难题。
We need to think about solutions to this, right from the start of the class, and we already talked about something.
从一上课开始,我们就应该开始,思考这些问题解决方案,现在我们已经谈论了一些了
What I though I'd do is just tease you with some visuals if you haven't gotten to the point of playing with the staff solution so the themes of problem set 3 are two-fold.
如果你们还没达到使用解决方案的程度,那现在我能做的就是用一些图形为你们梳理一下,习题集3的主题,是两方面的。
Now, I want to do one concrete problem where you will see how to use these derivatives.
现在我要解决一个具体的问题,从中你会明白如何运用这些导数
STUDENT: So, how do you come to a conclusion as to which you should use then, if you can determine the size based on solution, or based on input, so how do you decide?
学生:所以,你怎样决定你该用,哪个来算呢?现在如果你可以选择是,基于解决方案的大小,还是基于输入的大小,你应该怎样决定呢?
So the problem of infectious disease prevention and treatment isn't solved yet, you know this, right?
传染病预防和治疗的问题,现在仍然没有解决,你们应该了解,对吧
So we've got a chord progression.
现在我们把和弦进行的问题解决了。
So what is shown here is the potential solution to potentially read out neural signals dragged from the brain and use these signals after some interpretations or decrypting if you will to drive prosthetic arms or computer cursors on the screen.
大家现在看到的是一种可能的解决方案,有助于解读病人大脑发出的神经信号,同时在经过翻译或者解码之后,使用这些信号,驱动假臂,或者电脑屏上的光标。
Now, what we saw last time is there's a brute force solution.
现在,我们上次,看过穷举法解决方案。
So now I have this right hand side of the 4-cup problem.
现在就解决4个杯子问题中的右半部分。
For those perhaps familiar with some of the jargon do we introduce what we call link lists and hash tables and tries, increasingly sophisticated data structures, that allow us to solve problems that are much bigger and much more interesting than the very familiar one that we started with here.
那些对编程的术语较熟悉的同学,我们会教授,链接列表,哈希表,以及日益复杂的数据结构,以便帮助我们解决其他的,比现在所学的更大也更有趣的问题。
Now as for all these data sizes, let's close one outstanding question.
现在为了这些数据量,让我们先结束一个未解决的问题。
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.
至今为止我们已经处理过,亚线性问题,最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。
The algorithm on mine professed to be implementing now is this thing.
这个算法现在要,解决的就是这个问题。
Now, we are done because now we can ask how high does it go, and you go back to your y of 1 is 15+10-5, which is what?
现在问题解决了,因为我们可以算出,最高点的高度,你回到这个式子,求出y=15+10-5,是多少
So now we're left with a problem that's but 500 pages large and so what might a human do now to find Mike even more closely?
现在我们只用翻500页就能解决问题了,接下来,怎么做才能离Mike这个名字更近一步?
Once I've got that, you notice I can now define a polar point, same way. Notice I've now solved one of my problems, which is, in each one of these cases here, I'm creating both x y and radius angle values inside of there.
你们注意到我现在可以,定义一个极坐标点了,以同样的方式,请注意到现在,我已经解决了我的问题之一了,也就是,在这些例子中的每一个,我在里面都创建了x,y值。
应用推荐