14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.最新文献

EasyTransport: an effective navigation and transportation guide for wide geographic areas EasyTransport:为广大地理区域提供有效的导航和交通指南

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings. Pub Date : 2002-11-04 DOI: 10.1109/TAI.2002.1180794

M. Fragouli, A. Delis

{"title":"EasyTransport: an effective navigation and transportation guide for wide geographic areas","authors":"M. Fragouli, A. Delis","doi":"10.1109/TAI.2002.1180794","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180794","url":null,"abstract":"In this paper we present EasyTransport, a tool that offers effective navigation and/or transportation advice to travelers in wide geographic areas. Unlike most existing navigational and transportation advisory systems that utilize predefined paths connecting transition points and produce answers based on static information, EasyTransport uses no precompiled knowledge to generate the respective paths. The tool's underlying algorithm is based on the breadth-first-search (BFS) algorithm and traces dynamically feasible routes on a terrain. Our rationale is to reduce the number of nodes representing the possible points for a transition and thus the complexity of EasyTransport's operation. Since our algorithm functions with increasingly coarse geographic granularities, it can achieve its successful termination fast. We, furthermore, suggest heuristics that effectively manage the potentially enormous data sets in the geographic areas involved EasyTransport, is a highly interactive system that allows for easy querying and features flexible adaptation and presentation of the generated answers, ensures short response times, and offers useful getting-a round-and-how guidelines.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129457955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

A tool for extracting XML association rules 提取XML关联规则的工具

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings. Pub Date : 2002-11-04 DOI: 10.1109/TAI.2002.1180788

Daniele Braga, A. Campi, S. Ceri, M. Klemettinen, P. Lanzi

引用次数: 38

Maintenance scheduling of oil storage tanks using tabu-based genetic algorithm 基于禁忌遗传算法的储油罐维修调度

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings. Pub Date : 2002-11-04 DOI: 10.1109/TAI.2002.1180806

Sheng-Tun Li, Chuan-Kang Ting, Chungnan Lee, Shu‐Ching Chen

{"title":"Maintenance scheduling of oil storage tanks using tabu-based genetic algorithm","authors":"Sheng-Tun Li, Chuan-Kang Ting, Chungnan Lee, Shu‐Ching Chen","doi":"10.1109/TAI.2002.1180806","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180806","url":null,"abstract":"Due to the entry of Taiwan into WTO and the recently liberalized Petroleum Management Law, the oil market in Taiwan is liberalized and thus is becoming more competitive. However, the space limitation and the residents' increasing awareness of environmental protection issues in the island make international vendors unavoidably have to rent tanks from domestic oil companies. In order to help the leaseholder maximize revenue by increasing the availability of tanks, an efficient maintenance scheduling is needed. This paper introduces a tabu-based genetic algorithm (TGA) and its implementation for solving a real-world maintenance scheduling problem of oil storage tanks. TGA incorporates a tabu list to prevent inbreeding and utilizes an aspiration criterion to supply moderate selection pressure so that the selection efficiency is improved, and the population diversity is maintained. The experimental results validate that TGA outperform GA in terms of solution quality and convergence efficiency. Keywords: Tabu-based genetic algorithm, maintenance scheduling, tabu search, genetic algorithm.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132246433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

On temporal planning as CSP 关于时间规划作为CSP

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings. Pub Date : 2002-11-04 DOI: 10.1109/TAI.2002.1180790

A. Mali

{"title":"On temporal planning as CSP","authors":"A. Mali","doi":"10.1109/TAI.2002.1180790","DOIUrl":"https://doi.org/10.1109/TAI.2002.1180790","url":null,"abstract":"Recent advances in constraint satisfaction and heuristic search have made it possible to solve classical planning problems significantly faster. There is an increasing amount of work on extending these advances to solving more expressive planning problems which contain metric time, quantifiers and resource quantities. One can broadly classify classical planners into two categories: (i) planners doing refinement search and (ii) planners iteratively processing a representation of finite size like a SAT encoding or planning graph or a constraint satisfaction problem (CSP). One key challenge in the development of planners casting planning as SAT or CSP is the identification of constraints which are satisfied if and only if there is a plan of k steps. This task is even more complex for planners handling metric time and/or resource quantities and/or quantifiers. In this paper we show how such a SAT encoding can be synthesized for temporal planning. This encoding contains twenty kinds of constraints. We show how this encoding can be simplified. The set of constraints we identify makes it easier to develop temporal planners casting planning as a constraint satisfaction problem other than SAT, like integer linear programming (ILP). The SAT encoding can be easily adapted to more complex cases of temporal planning such as that in which different preconditions and effects of an action may be true at different times during its execution. We also discuss two additional SAT encodings of temporal planning. The encoding schemes make it easier to exploit progress in SAT and CSP solving to solve temporal planning problems.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116293845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

The semantics of proactive communication acts among team-based agents 主动通信的语义在基于团队的代理之间起作用

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings. Pub Date : 2002-11-04 DOI: 10.1109/TAI.2002.1180837

J. Yen, Xiaocong Fan

引用次数: 3

A framework for adaptive mail classification 用于自适应邮件分类的框架

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings. Pub Date : 2002-11-04 DOI: 10.1109/TAI.2002.1180829

G. Manco, E. Masciari, Andrea Tagarelli

引用次数: 22

Reinforcement learning in multiagent systems: a modular fuzzy approach with internal model capabilities 多智能体系统中的强化学习:具有内部模型能力的模块化模糊方法

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings. Pub Date : 2002-11-04 DOI: 10.1109/TAI.2002.1180840

Mehmet Kaya, R. Alhajj

引用次数: 9

An intelligent brokering system to support multi-agent Web-based 4/sup th/-party logistics 一个智能代理系统，支持基于web的多方代理物流

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings. Pub Date : 2002-11-04 DOI: 10.1109/TAI.2002.1180800

H. Lau, Yam Guan Goh

引用次数: 60

Logic grammars for diagnosis and repair 用于诊断和修复的逻辑语法

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings. Pub Date : 2002-11-04 DOI: 10.1109/TAI.2002.1180819

Henning Christiansen, V. Dahl

引用次数: 17

Reasoning on aspectual-temporal information in French within conceptual graphs 概念图中法语方面时间信息的推理

14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings. Pub Date : 2002-11-04 DOI: 10.1109/TAI.2002.1180820

Tassadit Amghar, D. Battistelli, Thierry Charnois

引用次数: 11