[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fXLPzgjbSOgD3rLXsYs4w_Bv3pDcRm8vDMLmAWKxtfOA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":16,"related":17,"source":23,"type":24},[],"2023-05-09 15:23:53",84712216,[8,9],"对","错",{"courseId":11,"courseImg":12,"courseName":13,"workId":14,"workName":15},"1000009682","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3c5d0661caec9f875f9be9dc6759678f.png","人工智能原理与技术","29411698","人工智能原理与技术教程考试","一幅扑克牌,除去大小王,随机抽取一张,记A为抽到J,B为抽到梅花,那么A与B不是相互独立的",[18,25,30,40,50,53,62,71,80,85],{"answer":19,"createTime":5,"id":20,"options":21,"question":22,"source":23,"type":24},[],84712128,[8,9],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F705bb8509faed3ceb21f73fdbc1ce53c.png\">","v2",3,{"answer":26,"createTime":5,"id":27,"options":28,"question":29,"source":23,"type":24},[],84712154,[8,9],"α-β搜索算法可以计算出和极大极小算法一样的最优招数,由于消除了被证明无关的子树,效率得到提高. ( )",{"answer":31,"createTime":5,"id":32,"options":33,"question":38,"source":23,"type":39},[],84712198,[34,35,36,37],"唐纳德型学习","赫布型学习","更新学习","强度更新学习","在人工智能的孕育期,唐纳德·赫布展示了一条简单的用于修改神经元之间的连接强度的更新规则,其被称为()",0,{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":23,"type":49},[],84712204,[44,45,46,47],"无监督学习","有监督学习","强化学习","半监督学习","智能体根据不同的反馈类型,决定了如下哪些主要的学习类型 ( )",1,{"answer":51,"createTime":5,"id":6,"options":52,"question":16,"source":23,"type":24},[],[8,9],{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":23,"type":49},[],84712238,[57,58,59,60],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F4f182555cd225a86cd702eeca08561d0.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fdfa3030818f8ec05d30ba3ce6e25553e.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fb254f9bb323d0ad087e49c803905777f.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd787223987444558fc5db86469c90aad.png\">","设D:全总个体域,F(x):x是兔子,L(x, y):x与y跑得同样快.则命题"不存在跑的同样快的兔子"的逻辑符号化为( )",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":23,"type":39},[],84712291,[66,67,68,69],"000-010-100-101-111","000-010-001-101-111","000-100-110-111","000-001-011-111","有一个农夫带一匹狼、一只羊和一棵白菜过河(从河的北岸到南岸).如果没有农夫看管,则狼要吃羊,羊要吃白菜.但是船很小,只够农夫带一样东西过河.用 0 和 1 表示狼、羊、白菜分别运到南岸的状态,0 表示不在南岸,1 表示在南岸,(如:100 表示只有狼运到南岸).初始时,南岸状态为 000,表示狼、羊、白菜都没运到南岸,最终状态为 111,表示狼、羊、白菜都运到了南岸.用状态空间为农夫找出过河方法,以下狼、羊、白菜在南岸出现的序列可能是( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":23,"type":39},[],84712317,[75,76,77,78],"在智能体自身的结构上运行","从感知序列到行动的映射","根据当前感知计算应采取的行动","可以用查表法实现","关于智能体程序的表述错误的是 ( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":84,"source":23,"type":24},[],84712332,[8,9],"公式对P(x, b, b),P(a, y, z)可合一,且最一般合一为σ={a\u002Fx, b\u002Fy, b\u002Fz}",{"answer":86,"createTime":5,"id":87,"options":88,"question":93,"source":23,"type":39},[],84712352,[89,90,91,92],"如果存在一条节点X指向节点Y 的有向边,则称X是Y的子节点","贝叶斯网络中可能存在有向环","一个具有k-1个布尔父节点的布尔变量的条件概率表中有2k-1个独立的可指定概率","贝叶斯网络是一个随机变量集组成网络节点,变量必须是离散的","下列说法中正确的是()"]