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

筛选
英文 中文
A neural network based expert system model 基于神经网络的专家系统模型
A. Hudli, M. Palakal, M. J. Zoran
{"title":"A neural network based expert system model","authors":"A. Hudli, M. Palakal, M. J. Zoran","doi":"10.1109/TAI.1991.167089","DOIUrl":"https://doi.org/10.1109/TAI.1991.167089","url":null,"abstract":"The architecture of an expert system model using artificial neural networks is proposed. The proposed model effectively supports the necessary components of an expert system such as user interface facility knowledge base, inference engine, and explanation system. The expert system model (ESM) consists of several orders of simple neural networks, each realizing a simple task. These simple neural networks are organized vertically, thereby achieving a second level of parallelism. A novel way to handle both forward and backward chaining reasoning mechanisms is presented. A secondary network model monitors the reasoning patterns of the primary model.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"662 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":"121998742","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
Automatic contour segmentation for object analysis 用于对象分析的自动轮廓分割
D. Hung, I. Chen
{"title":"Automatic contour segmentation for object analysis","authors":"D. Hung, I. Chen","doi":"10.1109/TAI.1991.167041","DOIUrl":"https://doi.org/10.1109/TAI.1991.167041","url":null,"abstract":"The problem of distinguishing shapes from a compound contour, which is formed by overlapping more than one distinct object, is considered. The algorithm exploits the fact that planar shapes can be completely described by contour segments, and that they can be decomposed at their maximum concavity into simpler objects. To reduce spurious decomposition, the decomposed segments are merged hypotheses. The algorithm calculates the linking possibility by weighting the angular differentiation which measures against k-curvature consistency. The techniques were implemented and applied to other partial shape matching problems for clustering purposes.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"513 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":"123249131","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
The determination of neural network parameters by information theory 用信息论确定神经网络参数
R. Brause
{"title":"The determination of neural network parameters by information theory","authors":"R. Brause","doi":"10.1109/TAI.1991.167110","DOIUrl":"https://doi.org/10.1109/TAI.1991.167110","url":null,"abstract":"The principle of optimal information distribution is a criterion for the efficient use of the different information storage resources in a given network. Furthermore, it can be used as a tool to balance the system parameters and to obtain the optimal network parameter configuration according to the minimal system storage (system description information) for a given maximal performance error. The principle was derived by maximizing the output information of the network. The use of the principle was demonstrated for the example of a simple nonlinear function approximation.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"25 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":"130606683","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
DYNORA: a real-time planning algorithm to meet response-time constraints in dynamic environments DYNORA:满足动态环境中响应时间约束的实时规划算法
B. Hamidzadeh, S. Shekhar
{"title":"DYNORA: a real-time planning algorithm to meet response-time constraints in dynamic environments","authors":"B. Hamidzadeh, S. Shekhar","doi":"10.1109/TAI.1991.167099","DOIUrl":"https://doi.org/10.1109/TAI.1991.167099","url":null,"abstract":"Most real-time planning algorithms address either the issue of response-time constraints or the issue of dynamic environments. A new real-time planning algorithm, DYNORA, is proposed to address both of these issues simultaneously. DYNORA is structured as a sequence of partial planning and execution cycles to avoid obsolescence of planning solutions at the time of execution. DYNORA uses a stopping criterion to balance planning cost and execution cost to achieve near optimal response times. DYNORA was used for the routing problem to optimize total cost. It shows better average-case time complexity than traditional real-time algorithms.<<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":"125826996","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
Representing and propagating constraints in temporal reasoning 时态推理中约束的表示和传播
H. Tolba, F. Charpillet, J. Haton
{"title":"Representing and propagating constraints in temporal reasoning","authors":"H. Tolba, F. Charpillet, J. Haton","doi":"10.1109/TAI.1991.167093","DOIUrl":"https://doi.org/10.1109/TAI.1991.167093","url":null,"abstract":"A new temporal representation combining the notions of intervals, dates, and durations is presented. The manipulation of this representation is based on the notion of time map managers (TMMs) allowing both kinds of constraints, symbolic or numeric. These algorithms are a generalization of AC4, an optimal algorithm for arc-consistency, and can handle n-ary constraints.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122034124","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
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学术官方微信