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

[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91最新文献

筛选
英文 中文
Shape analysis using morphological processing and genetic algorithms 形状分析使用形态处理和遗传算法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167087
J. Bala, H. Wechsler
{"title":"Shape analysis using morphological processing and genetic algorithms","authors":"J. Bala, H. Wechsler","doi":"10.1109/TAI.1991.167087","DOIUrl":"https://doi.org/10.1109/TAI.1991.167087","url":null,"abstract":"A novel way of combining morphological processing and genetic algorithms (GAs) to generate high-performance shape discrimination operators is presented. GAs can evolve operators that discriminate among classes comprising different shapes. The operators are defined as variable structuring elements and can be sequenced as program forms. The population of such operators, evaluated according to an index of performance corresponding to shape discrimination ability, evolves into an optimal set of operators using genetic search. Experimental results are presented to illustrate the feasibility of the approach for shape discrimination.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125475231","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}
引用次数: 14
Parallel path-consistency algorithms for constraint satisfaction 约束满足的并行路径一致性算法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167040
Somnuk Keretho, R. Loganantharaj, V. Gudivada
{"title":"Parallel path-consistency algorithms for constraint satisfaction","authors":"Somnuk Keretho, R. Loganantharaj, V. Gudivada","doi":"10.1109/TAI.1991.167040","DOIUrl":"https://doi.org/10.1109/TAI.1991.167040","url":null,"abstract":"The authors previously proposed (1991) a O(n/sup 3/) path-consistency algorithm which requires O(n/sup 2/) space, whereas other known O(n/sup 3/) time complexity algorithms need O(n/sup 3/) space. They use this algorithm as the main framework for a parallel version.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"31 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120822692","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}
引用次数: 7
Improving Han and Lee's path consistency algorithm 改进Han和Lee的路径一致性算法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167114
Yangjun Chen
{"title":"Improving Han and Lee's path consistency algorithm","authors":"Yangjun Chen","doi":"10.1109/TAI.1991.167114","DOIUrl":"https://doi.org/10.1109/TAI.1991.167114","url":null,"abstract":"C.C. Han and C.H. Lee (1988) presented a path consistency algorithm. A new algorithm is described for path consistency, and it is shown that the algorithm requires less time and space than Han and Lee's. The key idea of the algorithms is the arranging of the edges which are checked in the first part of Han and Lee's algorithm and the interlacing of the second part of the algorithm in the first part by using the symmetry of the triangle.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122898981","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
A methodology for creating and adapting reactive systems 一种用于创建和调整反应性系统的方法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167098
A. J. Hendriks, D. Lyons
{"title":"A methodology for creating and adapting reactive systems","authors":"A. J. Hendriks, D. Lyons","doi":"10.1109/TAI.1991.167098","DOIUrl":"https://doi.org/10.1109/TAI.1991.167098","url":null,"abstract":"A methodology is presented for building integrated planning-reacting systems. The work is based on a formal process-based approach to building the reactive component; this makes it possible to formalize the concept of a planner improving a reactor. The planner design emphasizes how the planner can use the reactor to focus its reasoning, as well as how the reactor is guided by the planner to improve its behavior. The reactive component (the reactor) is based on a process-based model of robot computation, the RS model. This gives a powerful representation for actions with precise formal semantics. The duty of the planning component (the planner) is to adapt the reactor to suit a set of objectives and the possibilities afforded by the environment. Planner and reactor both operate continually, separately and in a complementary fashion.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121617861","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
A heuristic search strategy for optimization of trade-off cost measures 权衡成本测度优化的启发式搜索策略
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167121
Rakesh Kumar Singh, Shashi Kumar, V. Arvind
{"title":"A heuristic search strategy for optimization of trade-off cost measures","authors":"Rakesh Kumar Singh, Shashi Kumar, V. Arvind","doi":"10.1109/TAI.1991.167121","DOIUrl":"https://doi.org/10.1109/TAI.1991.167121","url":null,"abstract":"The problem of optimization in a multiple-cost search space by combining admissible heuristic estimates for the different cost parameters is investigated. The authors propose an algorithm, MULT* for solving trade-off optimization problems for which there are good admissible heuristics available for each of the associated cost parameters. It is shown that MULT* is an admissible algorithm and it has many of the important properties of A*. Conditions are also given under which it is possible to prune paths in the search graph. A method is also given to relax admissibility of the heuristics to have a more efficient version of MULT* with a bounded decrease in solution quality.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"2 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120986937","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}
引用次数: 1
A new approach for the design of reinforcement schemes for learning automata: stochastic estimator learning algorithms 一种设计学习自动机强化方案的新方法:随机估计学习算法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167109
G. Papadimitriou
{"title":"A new approach for the design of reinforcement schemes for learning automata: stochastic estimator learning algorithms","authors":"G. Papadimitriou","doi":"10.1109/TAI.1991.167109","DOIUrl":"https://doi.org/10.1109/TAI.1991.167109","url":null,"abstract":"A new approach to the design of S-model ergodic learning automata is introduced. The new scheme uses a stochastic estimator and is able to operate in nonstationary environments with high accuracy and high adaptation rate. The estimator is always recently updated and, consequently, is able to be adapted to environmental changes. The performance of the stochastic estimator learning automation (SELA) is superior to that of the previous well-known S-model ergodic schemes. Furthermore, it is proved that SELA is absolutely expedient in every stationary S-model random environment.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128177694","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}
引用次数: 4
New crossover operators in genetic algorithms 遗传算法中的新交叉算子
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167090
Yi Shang, Guo-Jie Li
{"title":"New crossover operators in genetic algorithms","authors":"Yi Shang, Guo-Jie Li","doi":"10.1109/TAI.1991.167090","DOIUrl":"https://doi.org/10.1109/TAI.1991.167090","url":null,"abstract":"Two new crossover operators in genetic algorithms for solving some combinatorial problems with ordering are presented. One is enhanced order crossover (EOX). The other, GREE, is a heuristic crossover for a class of combinatorial optimization problems, such as traveling salesman problems (TSPs). Genetic algorithms using GREE as unique crossover run very fast and get good solutions. Combining GREE with EOX, genetic algorithms can find optimal or very near optimal solutions in a rather short time.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129210559","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}
引用次数: 18
Propositional logic for validating software object interrelationships 用于验证软件对象相互关系的命题逻辑
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167075
P. Bobbie, J. E. Urban
{"title":"Propositional logic for validating software object interrelationships","authors":"P. Bobbie, J. E. Urban","doi":"10.1109/TAI.1991.167075","DOIUrl":"https://doi.org/10.1109/TAI.1991.167075","url":null,"abstract":"The objective of this work is the application of propositional calculus to validate the consistency of the interrelationship between software objects. A software object is defined as an entity or element which has a name and a role, achieves an objective, and can be identified at the formative stages of eliciting requirements specifications. A relation is also an entity that binds two software objects and conveys an association between the object-pair. Such a binding produces logical propositions or arguments for reasoning about the interrelationships of the objects. The authors narrow the view of requirements specifications to a collection of several, perhaps hundreds, of propositions or arguments.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123836542","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
Knowledge-based configuration of computer systems using hierarchical partial choice 基于知识的分层部分选择计算机系统配置
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167117
B. M. Kramer
{"title":"Knowledge-based configuration of computer systems using hierarchical partial choice","authors":"B. M. Kramer","doi":"10.1109/TAI.1991.167117","DOIUrl":"https://doi.org/10.1109/TAI.1991.167117","url":null,"abstract":"A novel inference scheme is introduced which is called hierarchical partial choice and which efficiently generates configurations from a knowledge base of structural descriptions of computer components. This approach combines the acquisition and maintenance advantages (over rule-based systems) of a declarative system with an inference scheme that efficiently generates solutions, often with little backtracking. The inference scheme is presented in the context of XKEWB, a shell for building computer configuration expert systems. The system contains several improvements over its predecessor Cossack.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121493748","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
Knowledge based process scheduling on symmetric multiprocessors 基于知识的对称多处理机进程调度
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167031
Philip J. Christopher, A. Dollas
{"title":"Knowledge based process scheduling on symmetric multiprocessors","authors":"Philip J. Christopher, A. Dollas","doi":"10.1109/TAI.1991.167031","DOIUrl":"https://doi.org/10.1109/TAI.1991.167031","url":null,"abstract":"An examination is made of how knowledge about communication among processes can be used to improve task scheduling on symmetric multiprocessors. Two series of experiments have also been conducted on a symmetric multiprocessor to quantify the performance of a knowledge-based scheduler. It is shown that overall system performance is improved with the new approach.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121381104","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}
引用次数: 1
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信