首页 | 本学科首页   官方微博 | 高级检索  
     

无证书离线电子现金方案
引用本文:朱英宏,赵怀勋,苏光伟.无证书离线电子现金方案[J].计算机工程,2009,35(21):176-177,.
作者姓名:朱英宏  赵怀勋  苏光伟
作者单位:(1. 莆田学院电子信息工程学系,莆田 351100;2. 福州大学计算机科学与技术系,福州 350108)
基金项目:国家自然科学基金资助项目 
摘    要:在联盟结构生成过程中,同势的2个联盟通常具有相同值或相似值。在同势同值情况下建立不同联盟的限界时,必须搜索势结构图的最底两层。研究最优势结构生成问题,提出一种给定限界的势结构生成算法,确定需要进一步搜索的势结构。分析结果表明,搜索势结构图的最底两层和顶层后,通过搜索势结构集合,可以得到符合要求的限界。与其他势结构生成算法相比,该算法需要搜索的势结构数最少。

关 键 词:多Agent  势结构  联盟组合  限界
修稿时间: 

Certificateless off Line Scheme for Electronic Cash
Affiliation:(1. Department of Electronic Information Engineering, Putian University, Putian 351100;
2. Department of Computer Science and Technology, Fuzhou University, Fuzhou 350108)
Abstract:During the generating process of coalition structure, two coalitions with same cardinality always have same value or similitude value. It is necessary to search the lowest two levels of the cardinality structure graph while establishing a bound of different coalition with same cardinality and same value. This paper researches the problem about best cardinality structure generating, proposes an algorithm for cardinality structure generating with bound and ascertains cardinality structures need to be further searched. Analysis results show that the required bound can be achieved by searching the cardinality structure set after searching the lowest two levels and the top level of the cardinality structure graph. The number of cardinality structures for searching of this algorithm is minimal comparing with other algorithms for cardinality structure generating.
Keywords:multi-Agent  cardinality structure  coalition combination  bound
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号