发布求助
文献互助 智能选刊 最新文献

Proceedings 11th International Conference on Tools with Artificial Intelligence最新文献

筛选
英文 中文
SAMON: communication, cooperation and learning of mobile autonomous robotic agents SAMON:移动自主机器人代理的沟通、合作和学习
Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI: 10.1109/TAI.1999.809791
E. Eberbach, S. Phoha
{"title":"SAMON: communication, cooperation and learning of mobile autonomous robotic agents","authors":"E. Eberbach, S. Phoha","doi":"10.1109/TAI.1999.809791","DOIUrl":"https://doi.org/10.1109/TAI.1999.809791","url":null,"abstract":"The Applied Research Laboratory Penn State University \"Ocean SAmpling MObile network\" (SAMON) Project is developing the simulation testbed for the oceanographic communities interactions through the Web interface and the simulation based design of Autonomous Ocean Sampling Program missions. In this paper, a current implementation of the SAMON is presented, and a formal model based on interactive automata is described. The basic model is extended by process algebra constructs to handle mobility, evolution and learning. To allow cooperation of heterogeneous vehicles a generic behavior message-passing language is presented.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133896460","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}
引用次数: 19
Using an artificial intelligence approach to build an automated program understanding/fault localization tool 使用人工智能方法构建自动化程序理解/故障定位工具
Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI: 10.1109/TAI.1999.809768
I. Burnstein, F. Saner, Y. Limpiyakorn
{"title":"Using an artificial intelligence approach to build an automated program understanding/fault localization tool","authors":"I. Burnstein, F. Saner, Y. Limpiyakorn","doi":"10.1109/TAI.1999.809768","DOIUrl":"https://doi.org/10.1109/TAI.1999.809768","url":null,"abstract":"Artificial intelligence techniques and architectures have played a large role in the design of a blackboard-based program understanding/fault localization tool we have been developing. We focus on a system knowledge source called the plan processor which will have artificial intelligence support for two of its major tasks. One task is to retrieve a set of program plans from a plan library using indices called signatures. To make this retrieval task more effective we propose using a genetic algorithm. We also describe a fuzzy reasoning component which supports the plan processor with a second task; ranking the retrieved plans in order of similarity to the target code. The most similar plan is then used for the complex plan/code matching required for automated program understanding. Our approach may eliminate the need for exhaustive plan library searches, and could lead to automated program understanders that scale up for use on software systems from a variety of problem domains.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114278482","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}
引用次数: 3
A new GA approach for the vehicle routing problem 车辆路径问题的一种新的遗传算法
Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI: 10.1109/TAI.1999.809805
Juay Chin Ang, Wee-Kit Ho, A. Lim
{"title":"A new GA approach for the vehicle routing problem","authors":"Juay Chin Ang, Wee-Kit Ho, A. Lim","doi":"10.1109/TAI.1999.809805","DOIUrl":"https://doi.org/10.1109/TAI.1999.809805","url":null,"abstract":"This paper focuses on the study of a hybrid of two search heuristics, tabu search (TS) and genetic algorithms (GA) in the vehicle routing problem with time-windows (VRPTW). TS is a local search technique that has been successfully applied to many NP-complete problems. On the other hand, a GA which is capable of searching multiple search areas in a search space is good for diversification. We investigate whether a hybrid of the two heuristics outperforms the individual heuristics.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127810405","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}
引用次数: 22
An agent-based approach to developing intelligent virtual reality-based training systems 基于agent的智能虚拟现实训练系统开发方法
Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI: 10.1109/TAI.1999.809795
F. Lin, C. Su, M. Tseng
{"title":"An agent-based approach to developing intelligent virtual reality-based training systems","authors":"F. Lin, C. Su, M. Tseng","doi":"10.1109/TAI.1999.809795","DOIUrl":"https://doi.org/10.1109/TAI.1999.809795","url":null,"abstract":"This paper presents an agent-based approach to developing intelligent virtual reality-based training systems. The architecture of an intelligent virtual reality-based training system is modeled as five collaborative agents: training task-planning agent, simulation agent, performance evaluation agent, on-line instruction agent, and intelligent interface agent. The behavioral and knowledge models of each agent type and the mechanism of inter-agent interaction and coordination are described. A Petri net-based specification approach that gives the work formalism for effective modeling and implementation is elaborated. Finally, a computerized numeric control (CNC) milling operation virtual training prototype system is introduced to show the effectiveness of this approach.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116427530","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}
引用次数: 13
Learning to identify interesting links in intelligent information discovery 学习在智能信息发现中识别有趣的链接
Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI: 10.1109/TAI.1999.809832
Dimitris Fragoudis, S. Likothanassis
{"title":"Learning to identify interesting links in intelligent information discovery","authors":"Dimitris Fragoudis, S. Likothanassis","doi":"10.1109/TAI.1999.809832","DOIUrl":"https://doi.org/10.1109/TAI.1999.809832","url":null,"abstract":"In the age of information overload intelligent agents have proven themselves as a very useful tool for discovering information of interest on the Web. The information seeking process may be either static, by utilizing existing search engines or using collaborative techniques, or dynamic, by actively browsing the Web. In the second case, agents need to evaluate encountered hyperlinks and choose the promising ones for continuing their autonomous navigation. In this paper we describe a new learning method for identifying interesting links in autonomous information discovery and we present the preliminary results from applying the new method into difficult query domains.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125909358","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}
引用次数: 0
On the fine structure of large search spaces 大搜索空间的精细结构
Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI: 10.1109/TAI.1999.809786
C. Gomes, B. Selman
{"title":"On the fine structure of large search spaces","authors":"C. Gomes, B. Selman","doi":"10.1109/TAI.1999.809786","DOIUrl":"https://doi.org/10.1109/TAI.1999.809786","url":null,"abstract":"Recently, there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, often outperform deterministic strategies. In this paper, we relate the performance of randomized methods to the geometric properties of the underlying search space. In particular, our study reveals the inherent fractal nature of the search space at different-length scales, for a range of combinatorial problems. We also discuss the impact of these results on the design of better search methods.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125583774","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}
引用次数: 13
Box consistency through weak box consistency 从弱盒一致性到盒一致性
Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI: 10.1109/TAI.1999.809826
Laurent Granvilliers, F. Goualard, F. Benhamou
{"title":"Box consistency through weak box consistency","authors":"Laurent Granvilliers, F. Goualard, F. Benhamou","doi":"10.1109/TAI.1999.809826","DOIUrl":"https://doi.org/10.1109/TAI.1999.809826","url":null,"abstract":"Interval constraint solvers use local consistencies-among which one worth mentioning is box consistency-for computing verified solutions of real constraint systems. Though among the most efficient ones, the algorithm for enforcing box consistency suffers from the use of time-consuming operators. This paper first introduces box/sub /spl phi// consistency, a weakening of box consistency; this new notion then allows us to devise an adaptive algorithm that computes box consistency by enforcing box/sub /spl phi// consistency, decreasing the /spl phi/ parameter as variables' domains get tightened, then achieving eventually box/sub 0/ consistency, which is equivalent to box consistency. A new propagation algorithm is also given, that intensifies the use of the most contracting pruning functions based on box/spl phi/ consistency. The resulting algorithm is finally shown to outperform the original scheme for enforcing box consistency on a set of standard benchmarks.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126470534","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}
引用次数: 27
On a deductive reasoning model and method for uncertainty 不确定性的演绎推理模型与方法
Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI: 10.1109/TAI.1999.809781
Makoto Suzuki, T. Matsushima, S. Hirasawa
{"title":"On a deductive reasoning model and method for uncertainty","authors":"Makoto Suzuki, T. Matsushima, S. Hirasawa","doi":"10.1109/TAI.1999.809781","DOIUrl":"https://doi.org/10.1109/TAI.1999.809781","url":null,"abstract":"Discusses a problem of deduction with uncertainty that has been dealt with by various diagnostic expert systems. First, we propose a mathematical framework of deductive reasoning with uncertainty. The subject of the reasoning is the calculation of conditional probabilities. Second, we establish a new reasoning method. Our deduction algorithm can compute the conditional probabilities precisely. To put it another way around, the result minimizes the divergence.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133421249","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}
引用次数: 3
Mining fuzzy quantitative association rules 模糊定量关联规则挖掘
Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI: 10.1109/TAI.1999.809772
Weining Zhang
{"title":"Mining fuzzy quantitative association rules","authors":"Weining Zhang","doi":"10.1109/TAI.1999.809772","DOIUrl":"https://doi.org/10.1109/TAI.1999.809772","url":null,"abstract":"Given a relational database and a set of fuzzy terms defined for some attributes we consider the problem of mining fuzzy quantitative association rules that may contain crisp values, intervals, and fuzzy terms in both antecedent and consequent. We present an algorithm extended from the equi-depth partition (EDP) algorithm for solving this problem. Our approach combines interval partition with pre-defined fuzzy terms and is more general.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133540587","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}
引用次数: 87
On the sufficiency of limited testing for knowledge based systems 基于知识的系统有限测试的充分性
Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI: 10.1109/TAI.1999.809838
T. Menzies, B. Cukic
{"title":"On the sufficiency of limited testing for knowledge based systems","authors":"T. Menzies, B. Cukic","doi":"10.1109/TAI.1999.809838","DOIUrl":"https://doi.org/10.1109/TAI.1999.809838","url":null,"abstract":"Knowledge-based engineering and computational intelligence are expected to become core technologies in the design and manufacturing for the next generation of space exploration missions. Yet, if one is concerned with the reliability of knowledge based systems, studies indicate significant disagreement regarding the amount of testing needed for system assessment. The sizes of standard black-box test suites are impracticably large since the black-box approach neglects the internal structure of knowledge-based systems. On the contrary, practical results repeatedly indicate that only a few tests are needed to sample the range of behaviors of a knowledge-based program. In this paper, we model testing as a search process over the internal state space of the knowledge-based system. When comparing different test suites, the test suite that examines larger portion of the state space is considered more complete. Our goal is to investigate the trade-off between the completeness criterion and the size of test suites. The results of testing experiment on tens of thousands of mutants of real-world knowledge based systems indicate that a very limited gain in completeness can be achieved through prolonged testing. The use of simple (or random) search strategies for testing appears to be as powerful as testing by more thorough search algorithms.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127662925","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}
引用次数: 8
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信