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

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

筛选
英文 中文
Learning textural concepts through multilevel symbolic transformations 通过多层符号转换学习纹理概念
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167081
J. Bala, R. Michalski
{"title":"Learning textural concepts through multilevel symbolic transformations","authors":"J. Bala, R. Michalski","doi":"10.1109/TAI.1991.167081","DOIUrl":"https://doi.org/10.1109/TAI.1991.167081","url":null,"abstract":"The TEXTRAL system, used for determining structural visual properties of textures through symbolic transformations, is presented. The method consists of two phases: one that extracts information from raw textural images by applying convolutional operators and learns an initial set of rules; and a second that iteratively extracts symbolic information from the transformed representation of initial image and learns another set of rules. The transformed symbolic representation is obtained by applying previously learned rules to a new image location and generating symbolic images based on rule assertions.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"95 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":"121746790","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
Reducing the search time of a steady state genetic algorithm using the immigration operator 利用迁移算子减少稳态遗传算法的搜索时间
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167032
M. C. Moed, Charles V. Stewart, R. Kelley
{"title":"Reducing the search time of a steady state genetic algorithm using the immigration operator","authors":"M. C. Moed, Charles V. Stewart, R. Kelley","doi":"10.1109/TAI.1991.167032","DOIUrl":"https://doi.org/10.1109/TAI.1991.167032","url":null,"abstract":"An examination is made of the fundamental trade-off between exploration and exploitation in a genetic algorithm (GA). An immigration operator is introduced that infuses random members into successive GA populations. It is theorized that immigration maintains much of the exploitation of the GA while increasing exploration. To test this theory, a set of functions that often require the GA to perform an excessive number of evaluations to find the global optimum of the function is designed. For These functions, it is shown experimentally that a GA enhanced with immigration (1) reduces the number of trials that require an excessive number of evaluations and (2) decreases the average number of evaluations needed to find the optimum function.<<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":"121944598","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}
引用次数: 41
A genetic algorithm programming environment: Splicer 一个遗传算法编程环境:Splicer
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167088
Steven E. Bayer, Lui Wang
{"title":"A genetic algorithm programming environment: Splicer","authors":"Steven E. Bayer, Lui Wang","doi":"10.1109/TAI.1991.167088","DOIUrl":"https://doi.org/10.1109/TAI.1991.167088","url":null,"abstract":"Genetic algorithms have been used to solve parameter optimization problems and for machine learning. Basic genetic algorithm concepts are introduced. The authors discuss genetic algorithm applications, and present results of a project to develop a software tool-a genetic algorithm programming environment-called Splicer.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"85 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":"122089024","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
A maxima-tracking method for skeletonization from Euclidean distance function 基于欧氏距离函数的骨架化最大跟踪方法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167101
F. Shih, C. C. Pu
{"title":"A maxima-tracking method for skeletonization from Euclidean distance function","authors":"F. Shih, C. C. Pu","doi":"10.1109/TAI.1991.167101","DOIUrl":"https://doi.org/10.1109/TAI.1991.167101","url":null,"abstract":"A skeletonization algorithm based on the Euclidean distance function using the sequential maxima-tracking method is described which, when applied to a connected image, generates a connected skeleton composed of simple digital arcs. With a slight modification, the algorithm can preserve the more important features in the skeletal branches which touch the object boundary at corners. Therefore its application to shape recognition can be easily achieved.<<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":"127952820","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}
引用次数: 9
Components of expertise for knowledge level modeling 知识级建模的专业知识组件
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167039
R. Chang, G. S. Novak
{"title":"Components of expertise for knowledge level modeling","authors":"R. Chang, G. S. Novak","doi":"10.1109/TAI.1991.167039","DOIUrl":"https://doi.org/10.1109/TAI.1991.167039","url":null,"abstract":"A new dimension of object-oriented components is presented to describe knowledge-level models of an application. From the knowledge-level perspective, components are needed for modeling the problems, solution methods, and their relationships in a problem-solving process. A problem can often be decomposed recursively by various methods into subproblems until reaching primitive ones. Each primitive problem is confined to a simple computational task, which can be solved by one problem-solving method. The process of problem solving is viewed as a modeling activity through explicitly represented knowledge-level models that are, then, operationalized. Design issues that are encountered when developing such a component-based framework for knowledge-level modeling are described.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"24 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":"133760788","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
Abstraction of formal specifications from program code 从程序代码中抽象形式规范
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167086
B. Cheng, G. Gannod
{"title":"Abstraction of formal specifications from program code","authors":"B. Cheng, G. Gannod","doi":"10.1109/TAI.1991.167086","DOIUrl":"https://doi.org/10.1109/TAI.1991.167086","url":null,"abstract":"A description is presented of the development of the tool AUTOSPEC (automated specification), which abstracts formal specifications from program code. The abstraction process can incorporate domain-specific information supplied interactively by the user, as necessary. The abstraction algorithms and a discussion of the use of formal methods and object-oriented techniques for the development of AUTOSPEC are given. Implementation-specific information is given and related work is described.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"7 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":"130572271","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}
引用次数: 31
An intelligent mediator for database application development 用于数据库应用程序开发的智能中介
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167124
L. Marinos, R. A. Smit, S. Oei, Jan Sirks, M. D. Jong, J. V. D. Meersch
{"title":"An intelligent mediator for database application development","authors":"L. Marinos, R. A. Smit, S. Oei, Jan Sirks, M. D. Jong, J. V. D. Meersch","doi":"10.1109/TAI.1991.167124","DOIUrl":"https://doi.org/10.1109/TAI.1991.167124","url":null,"abstract":"The authors elaborate on the structure and functionality of a front-end to a relational database. By using object-oriented features they overcome problems emanating from the monolithic nature of the relational model. At the same time, by maintaining knowledge about the database schema at the level of the front-end, they guarantee consistent manipulation of the database information, while on the other hand providing a transparent access to the underlying database.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"85 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":"131164802","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
Iterative development life cycle (IDLC): a management process for large scale intelligent system development 迭代开发生命周期(IDLC):大规模智能系统开发的管理过程
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167042
F. Miller, Rosemarie J. Paradis, Kevin Whalen
{"title":"Iterative development life cycle (IDLC): a management process for large scale intelligent system development","authors":"F. Miller, Rosemarie J. Paradis, Kevin Whalen","doi":"10.1109/TAI.1991.167042","DOIUrl":"https://doi.org/10.1109/TAI.1991.167042","url":null,"abstract":"The iterative development life cycle (IDLC) provides a management process for the successful development of large-scale intelligent system applications. The iterative process minimizes both risks and costs by combining both the well structured management techniques of the waterfall process and the early validation techniques of the evolutionary model. This process is more adaptable to the full range of software project situations and provides the flexibility necessary to accommodate a high dynamic range of technical alternatives.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"5 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":"126631889","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
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
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
首页 上一页 下一页 尾页
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学术官方微信