检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《北京工业大学学报》2001年第3期266-272,共7页Journal of Beijing University of Technology
摘 要:针对目前普遍采用的分支分类方法一般只能得到局部最优解这一问题,首先提出了一条与俭约性原理等价的定理,然后就使用同步系数进行分类时可能出现的情况进行了讨论,同时给出了几条有关定理.在此基础上,对最大同步法给出了一个反例并提出了一种修正算法.实验结果表明该算法是正确的和可行的,且能保证不劣于最大同步法.The methods of cbranch classification adopted universally at present can only provide a locally optimal solution. Firstly, a theorem equivalent to the principle of Parsimony is put forward in this thesis. And then, some possible cases are discussed when the method of maximal synchronization is used for classification and a few relevant theorems are given. On this basis a example counter for the method of maximal synchronization is raised and an amendment algorithm is given. The experimental results show that thes algorithm is correct and feasible and at least as good as the method of maximal sychronization.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.179