So he's packing and unpacking, packing and unpacking, trying all possible combinations of objects that will obey the constraint. And then choosing the winner. Well, this is like an algorithm we've seen before. It's not greedy.

因此它不断装包和清包,尝试了所有满足约束条件的物品组合,最后选择最优者,这很像我们以前看过的一个算法,这不是贪婪算法。

麻省理工公开课 - 计算机科学及编程导论课程节选

I'll compute its value. Then I'll empty the backpack out, put another combination of stuff compute its value, try all possible ways of filling up the backpack, and then when I'm done, I'll know which was the best.

直至把它填满，然后计算价值,然后我把包里的东西都导出来,再换一堆东西计算它们的价值,尝试过所有填满包的方案后,我就知道哪一种方案是最好的了。

麻省理工公开课 - 计算机科学及编程导论课程节选

The nucleus contains all the DNA, and so the early stages of gene expression, transcription, happened inside the nucleus where all the DNA is.

NA都在细胞核里,所以早期的基因表达,转录,发生在将所有DNA,都包于其中的细胞核中

耶鲁公开课 - 生物医学工程探索课程节选