[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fQ_Ukh9J6aGANlyl2DGGBXAkJZfhIi1nXjiCdCsK7lu0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":27,"type":48},[],"2023-05-07 18:50:38",12467290,[8,9,10,11],"启发函数的性能与启发知识的数量成正比","启发式搜索在生活中有很多应用,如语音识别等","博弈搜索考虑的是多个角色的最优路径选择问题","博弈搜索中,可以将最大化对方的得分转化为最小化我方得分",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000009004","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff4e4dd841924a91dc656054650011ffd.jpeg","人工智能基础导学","7005794","人工智能基础导学教程考试","以下说法错误的是",[20,29,34,39,49,54,59,68,73,82],{"answer":21,"createTime":5,"id":22,"options":23,"question":26,"source":27,"type":28},[],12467251,[24,25],"对","错","模拟大脑的视觉处理过程就是卷积神经网络的思路","v2",3,{"answer":30,"createTime":5,"id":31,"options":32,"question":33,"source":27,"type":28},[],12467256,[24,25],"卷积神经网络模拟了人类视觉信息处理的过程",{"answer":35,"createTime":5,"id":36,"options":37,"question":38,"source":27,"type":28},[],12467261,[24,25],"对权重的训练直到某个权重对所有样本均不产生错误,或者错误不再降低",{"answer":40,"createTime":5,"id":41,"options":42,"question":47,"source":27,"type":48},[],12467266,[43,44,45,46],"贪婪搜索够在"0-1背包问题"中获得全局最优解","农夫过桥问题的状态图有明确的"解状态",即全都过河","启发式搜索中h(n)的比重过大会导致问题找不到最优解","固定深度的博弈搜索根据人们在实际对弈中往往只向前考虑几步的情况提出","下列说法不正确的是()",0,{"answer":50,"createTime":5,"id":51,"options":52,"question":53,"source":27,"type":28},[],12467269,[24,25],"人工智能的第二次浪潮中最核心的是西蒙和纽厄尔推崇的自动定理证明方法",{"answer":55,"createTime":5,"id":56,"options":57,"question":58,"source":27,"type":28},[],12467277,[24,25],"多隐层的人工神经网络具有优异的特征学习能力",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":27,"type":48},[],12467284,[63,64,65,66],"极大极小策略适合棋局对弈游戏,能够在实际中很好的运用","A*算法中规定启发函数h(n)必须小于等于h*(n)","固定深度博弈通过设计启发函数来评估叶节点的得分","启发式搜索在统计语音识别、机器翻译问题中都得到应用","下列说法不正确的是( )",{"answer":69,"createTime":5,"id":70,"options":71,"question":72,"source":27,"type":28},[],12467285,[24,25],""人工神经网络"用计算机模拟神经元及其连接,以实现自主识别、判断",{"answer":74,"createTime":5,"id":75,"options":76,"question":81,"source":27,"type":48},[],12467286,[77,78,79,80],"3","2","1","0","以下说法正确的个数有()a) 在八格游戏中使用宽度优先搜索,先搜索"空位"可能的移动状态b) 贪婪算法求得的结果可能是局部最优结果c) 通用搜索策略在搜索的过程中不对状态优劣进行判断",{"answer":83,"createTime":5,"id":6,"options":84,"question":18,"source":27,"type":48},[],[8,9,10,11]]