用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Autonomous Intelligent Systems: Multi-Agents and Data Mining; Second International Vladimir Gorodetsky,Chengqi Zhang,Longbing Cao Conferenc

[复制链接]
查看: 25710|回复: 66
发表于 2025-3-21 19:51:59 | 显示全部楼层 |阅读模式
期刊全称Autonomous Intelligent Systems: Multi-Agents and Data Mining
期刊简称Second International
影响因子2023Vladimir Gorodetsky,Chengqi Zhang,Longbing Cao
视频video
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Autonomous Intelligent Systems: Multi-Agents and Data Mining; Second International Vladimir Gorodetsky,Chengqi Zhang,Longbing Cao Conferenc
影响因子Since early 1990, multi-agent systems (MAS), data mining, and knowledge d- covery (KDD) have remained areas of high interest in the research and - velopment of intelligent information technologies. Indeed, MAS o?ers powerful metaphors for information system conceptualization, a range of new techniques, and technologies speci?cally focused on the design and implementation of lar- scale open distributed intelligent systems. KDD also provides intelligent inf- mation technology with powerful ideas, algorithms, and software means to help cope with the main problem of arti?cial intelligence, formulated in the we- known question “Where does the knowledge come from?”, thus actually making modern applications intelligent and adaptive. The evident recent trend in both science and industry is to integrate and take advantage of both technologies. The existing experience with combined application of multi-agent technology to design architectures of distributed (- erarchical and peer-to-peer) data mining and KDD systems, as well as the u- lization of data mining and KDD achievements to provide enhanced intelligence of MAS, con?rms the fact that both technologies are capable of mutual enri- ment
Pindex Conference proceedings 2007
The information of publication is updating

书目名称Autonomous Intelligent Systems: Multi-Agents and Data Mining影响因子(影响力)




书目名称Autonomous Intelligent Systems: Multi-Agents and Data Mining影响因子(影响力)学科排名




书目名称Autonomous Intelligent Systems: Multi-Agents and Data Mining网络公开度




书目名称Autonomous Intelligent Systems: Multi-Agents and Data Mining网络公开度学科排名




书目名称Autonomous Intelligent Systems: Multi-Agents and Data Mining被引频次




书目名称Autonomous Intelligent Systems: Multi-Agents and Data Mining被引频次学科排名




书目名称Autonomous Intelligent Systems: Multi-Agents and Data Mining年度引用




书目名称Autonomous Intelligent Systems: Multi-Agents and Data Mining年度引用学科排名




书目名称Autonomous Intelligent Systems: Multi-Agents and Data Mining读者反馈




书目名称Autonomous Intelligent Systems: Multi-Agents and Data Mining读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:38:28 | 显示全部楼层
Hans-Jörg Kreowski,Grzegorz Rozenberge number of bids grow. This paper shows how to build an ant system for autonomous agents. In addition, it assigns customer agents’ services to supplier agents’ bids in the best possible way while considering several factors.
发表于 2025-3-22 00:31:19 | 显示全部楼层
Géza Kulcsár,Malte Lochau,Andy Schürrt the sub-datasets for the classifier training agents are obtained by dividing the features rather than by dividing the sample set in distribution environment. Experimental results show that this method has a preferable performance on high dimensional datasets.
发表于 2025-3-22 05:34:44 | 显示全部楼层
发表于 2025-3-22 11:24:40 | 显示全部楼层
Graph Rewriting and Relabeling with PBPO solutions of two top Botvinnik’s tests – the Reti and Nodareishvili etudes. For min max game tree based search algorithms these etudes appears to be computationally hard due the depth of the required analysis and very dependence on the expert knowledge.
发表于 2025-3-22 16:26:31 | 显示全部楼层
发表于 2025-3-22 18:03:00 | 显示全部楼层
发表于 2025-3-22 21:39:19 | 显示全部楼层
发表于 2025-3-23 01:46:24 | 显示全部楼层
发表于 2025-3-23 06:52:26 | 显示全部楼层
On Competing Agents Consistent with Expert Knowledge solutions of two top Botvinnik’s tests – the Reti and Nodareishvili etudes. For min max game tree based search algorithms these etudes appears to be computationally hard due the depth of the required analysis and very dependence on the expert knowledge.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-6 16:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表