找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Agents and Artificial Intelligence; 11th International C Jaap van den Herik,Ana Paula Rocha,Luc Steels Conference proceedings 2019 Springer

[復(fù)制鏈接]
樓主: ominous
21#
發(fā)表于 2025-3-25 03:31:01 | 只看該作者
22#
發(fā)表于 2025-3-25 08:26:02 | 只看該作者
23#
發(fā)表于 2025-3-25 14:48:13 | 只看該作者
https://doi.org/10.1057/9780230509818We propose a neural hidden Markov models to compute the transition probabilities of higher-order hidden Markov model by a neural network and reduce the cost of computation. It is applied for time-aware recommender systems to show the benefits from the hybrid of combining neural network and hidden Ma
24#
發(fā)表于 2025-3-25 18:46:15 | 只看該作者
Reports from Contemporary Businesserving multi-agent planning, where multiple agents plan for a common goal but with private information they do not want to disclose. Heuristic search is the dominant technique used in MAP and therefore it is not surprising that a significant attention has been paid to distributed heuristic computati
25#
發(fā)表于 2025-3-25 22:11:46 | 只看該作者
26#
發(fā)表于 2025-3-26 02:12:50 | 只看該作者
27#
發(fā)表于 2025-3-26 05:59:27 | 只看該作者
28#
發(fā)表于 2025-3-26 10:30:20 | 只看該作者
https://doi.org/10.1057/9780230509818ded belief. Based on Public Announcement Logic, we define our logic, Logic Of Narrow-minded belief (LON), as that which includes such belief. Semantics for LON is provided by the Kripke-style semantics, and using this semantics, we formally analyze the mental state of the hero of Shakespeare’s trage
29#
發(fā)表于 2025-3-26 12:59:58 | 只看該作者
https://doi.org/10.1057/9780230509818nts and to improve the productivity in shield tunneling, a widely used tunnel construction method. This study considers the amount of soil excavated along a tunnel composed of the segments as an objective, and the deviation limit as constraints. In this problem, a feasible solution can be easily fou
30#
發(fā)表于 2025-3-26 20:51:07 | 只看該作者
Culture and Power in England, 1585–1685mputational expensive as it requires to solve an NP-hard shunting planning problem. Currently, NS uses a shunt plan simulator where a local search heuristic is implemented to determine such capacities..In this paper, we study how to combine machine learning with local search in order to speed up fin
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-14 14:33
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
河源市| 厦门市| 博爱县| 绍兴县| 温泉县| 和顺县| 大悟县| 建昌县| 水城县| 隆化县| 临沭县| 乌拉特后旗| 吐鲁番市| 林州市| 靖州| 沈阳市| 广东省| 道真| 太仓市| 建始县| 青河县| 庄浪县| 叶城县| 丰镇市| 嘉定区| 怀集县| 潞西市| 弥渡县| 久治县| 山阳县| 雷山县| 聂荣县| 景洪市| 长顺县| 桂林市| 高青县| 历史| 临夏县| 合作市| 荥经县| 南乐县|