Speculative computation with deadline and its resource negotiation under time constraints

Liming Wang, Houkuan Huang, Yu-mei Chai
{"title":"Speculative computation with deadline and its resource negotiation under time constraints","authors":"Liming Wang, Houkuan Huang, Yu-mei Chai","doi":"10.1109/IAT.2004.1342969","DOIUrl":null,"url":null,"abstract":"Speculative computation is based on abduction, and it can give result of decision in advance based on defaults under incomplete resource information. To achieve goals and reduce risks of decision, master agent in speculative computation makes efforts to obtain more information via negotiation. However, the speculative computation and negotiation have usually deadlines. In This work, framework extended of speculative computation with deadline is presented, and the further negotiation framework and negotiation algorithm under time constraints are presented, the algorithm is embedded in speculative computation. The experiments have proved the algorithm can improve the accuracy of result of speculative computation, reduce the risk of the result.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAT.2004.1342969","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Speculative computation is based on abduction, and it can give result of decision in advance based on defaults under incomplete resource information. To achieve goals and reduce risks of decision, master agent in speculative computation makes efforts to obtain more information via negotiation. However, the speculative computation and negotiation have usually deadlines. In This work, framework extended of speculative computation with deadline is presented, and the further negotiation framework and negotiation algorithm under time constraints are presented, the algorithm is embedded in speculative computation. The experiments have proved the algorithm can improve the accuracy of result of speculative computation, reduce the risk of the result.
有期限的推测计算及其在时间约束下的资源协商
推测计算基于溯因法,可以在资源信息不完全的情况下给出基于默认值的提前决策结果。投机计算中的主代理为了达到目标和降低决策风险,努力通过协商获得更多的信息。然而,投机性的计算和谈判通常都有最后期限。本文提出了带期限的推测计算框架扩展,提出了基于时间约束的进一步协商框架和协商算法,并将该算法嵌入推测计算中。实验证明,该算法可以提高推测计算结果的准确性,降低计算结果的风险。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信