找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Agents and Artificial Intelligence; 4th International Co Joaquim Filipe,Ana Fred Conference proceedings 2013 The Editor(s) (if applicable)

[复制链接]
楼主: deliberate
发表于 2025-3-23 13:04:00 | 显示全部楼层
发表于 2025-3-23 17:38:13 | 显示全部楼层
发表于 2025-3-23 19:04:09 | 显示全部楼层
Admissible Distance Heuristics for General Gamesis the automatic construction of a good evaluation function for these games. Distance features are an important aspect of such an evaluation function, measuring, e.g., the distance of a pawn towards the promotion rank in chess or the distance between Pac-Man and the ghosts..However, current distance
发表于 2025-3-24 01:51:48 | 显示全部楼层
Retrieving Topological Information for Mobile Robots Provided with Grid Mapsused in robotics do not provide any evidence as to connectivity, making it harder to find appropriate paths to particular points on the site. Therefore, abstracting the environment where mobile robots carry out some mission can be of a great benefit..Topological maps have been increasingly used in r
发表于 2025-3-24 05:39:45 | 显示全部楼层
Timeline Planning in the J-TRE Environmentlanners have been demonstrated as successful in modeling and solving problems in several real world domains. In spite of these successes, any aspect related to search control remains a “black art” for few experts of the particular approach mostly because these architectures are huge application deve
发表于 2025-3-24 06:35:03 | 显示全部楼层
Efficient Spatial Reasoning with Rectangular Cardinal Relations and Metric Constraintsted and efficient way. In this paper, we focus our attention on the so-called Rectangular Cardinal Direction calculus for qualitative spatial reasoning on cardinal relations between rectangles whose sides are parallel to the axes of a fixed reference system. We show how to extend its convex tractabl
发表于 2025-3-24 13:08:33 | 显示全部楼层
Sorting High-Dimensional Patterns with Unsupervised Nearest Neighborstasks. In this work we present an approach to non-linear dimensionality reduction based on fitting nearest neighbor regression to the unsupervised regression framework for learning low-dimensional manifolds. The problem of optimizing latent neighborhoods is difficult to solve, but the unsupervised n
发表于 2025-3-24 17:39:34 | 显示全部楼层
发表于 2025-3-24 22:53:04 | 显示全部楼层
发表于 2025-3-24 23:58:40 | 显示全部楼层
Communications in Computer and Information Sciencehttp://image.papertrans.cn/a/image/151224.jpg
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 17:20
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表