Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Acta Electronica Sinica》 1993-11
Add to Favorite Get Latest Update

Backward Heuristic Search Algorithm BFAO for General AND/OR Graph

Wang Shitong(Zhenjiang Shipbuilding Institute,Zhenjiang,Jiangsu 212003)  
Fuzzy general AND/OR graphs of a new type are defined on triangle norm and its extension.The backward heuristic search algorithm BFAO" for fuzzy general AND/OR graphs is presented,in terms of newly-defined heuristic function h(n,x) and the principle that all subtrees of the optimum solution tree for fuzzy general AND/OR graph are also optimum subtrees.The admissibliry of algorithm BFAO is proved.In this paper,two new monotone restrictions for heuristic function h(n,x) are also defined.Based on these,the characteristic of monotone restrictions for algorithm BFAO is investigated,and the comparison between two BFAO algorithm is discussed.
【Fund】: 国家自然科学基金
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved