人工智能专业英语Unit 4.pptx
《人工智能专业英语Unit 4.pptx》由会员分享,可在线阅读,更多相关《人工智能专业英语Unit 4.pptx(41页珍藏版)》请在汇文网上搜索。
1、Unit 4 Search Methods in Artificial Intelligence人工智能专业英语 教学课件ContentsPart 1 Reading and TranslatingSection A:Heuristic SearchSection B:Genetic AlgorithmsPart 2 Simulated Writing:Using Presentation Software to WritePart 3 Listening&SpeakingDialogue:Search Methods in Artificial IntelligenceListening C
2、omprehension:A*SearchDictation:Heuristic Search TechniquesSection A:Heuristic SearchWordsstrawberrystrbri n.草莓gutgt adj.本能的,直觉的,简单的tastyteisti adj.美味的functionfkn n.函数ratingreiti n.等级评定,等级traversaltrvrs()l n.遍历Section A:Heuristic SearchPhrasesuninformed search 盲目搜索trust in 信任decide on 选定,决定subject to
3、 受制于prefer over 更喜欢Section A:Heuristic SearchExercisesI.Read the following statements carefully,and decide whether they are true(T)or false(F)according to the text._ 1It is guaranteed that the best node(that is,the one with the lowest heuristic value)is always at the end of the list._ 2There is a de
4、licate difference between the effort to find a solution and the total cost of this solution._ 3The worst heuristic would be a function that calculates the actual costs from each node to the goal._ 4Finding a good solution quickly is better than finding an optimal solution._ 5Modeling a heuristic mat
5、hematically can use a heuristic evaluation function f(s)for states.Section A:Heuristic SearchII.Choose the best answer to each of the following questions according to the text.1Which of the following is very expensive to derive?AA solution that is optimalBA good solution found quicklyCA good solutio
6、n found slowlyDAll of the above2Which of the following is guaranteed?AThe best node(that is,the one with the lowest heuristic value)is always in the middle of the list.BThe best node(that is,the one with the lowest heuristic value)is always at the end of the list.CThe best node(that is,the one with
7、the lowest heuristic value)is always at the beginning of the list.DNone of the aboveSection A:Heuristic SearchII.Choose the best answer to each of the following questions according to the text.3What kind of difference is there between the effort to find a solution and the total cost of this solution
8、 according to this text?AA subtle differenceBA simple differenceCAn obvious differenceDNone of the aboveSection A:Heuristic SearchIV.Translate the following passage into ChineseTravelling Salesman ProblemA salesman wants to travel to N cities(he should pass by each city).How can we order the cities
9、so that the salesmans journey will be the shortest?The objective function to minimize here is the length of the journey(the sum of the distances between all the cities in a specified order).To start solving this problem,we need:Configuration setting:This is the permutation of the cities from 1 to N,
10、given in all orders.Selecting an optimal one between these permutations is our aim.Rearrangement strategy:The strategy that we will follow here is replacing sections of the path,and replacing them with random ones to retest if this modified one is optimal or not.The objective function(which is the a
11、im of the minimization):This is the sum of the distances between all the cities for a specific order.Section B:Genetic AlgorithmsWordspopulationppjulein n.种群fitnessftns n.适应度,健康recombinationri,kmbinei()n;,rikmb-n.重组mutationmjutein n.变异,突变offspringfspri n.后代,子孙crossoverkrsuv(r)n.组合交叉nomenclaturenmekl
12、t(r)n.术语,命名法 stuckstk adj.(因困难)无法继续的,停滞不前的stochasticstkstik n.随机的,猜测的Section B:Genetic AlgorithmsPhrasesend up with 以告终,以结束local optimum 局部最优,局部优化come into play (使)开始起作用Section B:Genetic AlgorithmsNotes1 遗传算法(genetic algorithm)是计算机科学人工智能领域中用于解决最优化的一种搜索启发式算法,是进化算法的一种。这种启发式通常用来生成有用的解决方案来优化和搜索问题。进化算法最初
13、是借鉴了进化生物学中的一些现象而发展起来的,这些现象包括遗传、突变、自然选择以及杂交等。遗传算法在适应度函数选择不当的情况下有可能收敛于局部最优,而不能达到全局最优。Section B:Genetic AlgorithmsExercisesI.Read the following statements carefully,and decide whether they are true(T)or false(F)according to the text._ 1The concept of selection is inspired by the theory of artificial se
14、lection._ 2Crossover is also called recombination._ 3Mutation might make that individual better or worse than existing individuals._ 4An evaluation function is also referred to as a fitness function._ 5A genetic algorithm is a kind of heuristic algorithm.Section B:Genetic AlgorithmsII.Choose the bes
15、t answer to each of the following questions according to the text.1Which of the following probabilistic operators do we apply in order to generate the next generation of individuals?ASelectionBCrossoverCMutationDAll of the above2Which kind of algorithm does a genetic algorithm belong to?AK-MeansBHeu
16、risticCDQNDQ-learningSection B:Genetic AlgorithmsII.Choose the best answer to each of the following questions according to the text.3What do we need to have in order to apply crossover and mutation?ASelection criteriaBRecombinationCRandom changesDNone of the aboveSection B:Genetic AlgorithmsIV.Trans
- 1.请仔细阅读文档,确保文档完整性,对于不预览、不比对内容而直接下载带来的问题本站不予受理。
- 2.下载的文档,不会出现我们的网址水印。
- 3、该文档所得收入(下载+内容+预览)归上传者、原创作者;如果您是本文档原作者,请点此认领!既往收益都归您。
下载文档到电脑,查找使用更方便
10 积分
下载 | 加入VIP,下载共享资源 |
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 人工智能专业英语Unit 人工智能 专业 英语 Unit