期刊文献+

基于指数分布的可恢复加拿大旅行者问题的策略研究 被引量:1

Research on Strategy for Stochastic Blockage Recovery time in Canadian Travel Problem Based on Exponential Distribution
原文传递
导出
摘要 针对旅行者在行走过程中遇到的某一或一系列无法预知堵塞事件的加拿大旅行者问题,考虑每个堵塞恢复时间是一个相互独立随机变量且服从指数分布的情形,从在线问题与竞争策略的角度,给出了等待策略和贪婪策略以及相应策略下的竞争比,并对两种策略的执行效果进行了分析和比较. The online Canadian Traveler Problem (CTP) is considered for the case when the blockages occur one by one without any predictable information. From the online point of view, the waiting strategy and the greedy strategy are proposed. The competitive ratios of the two Strategies are given based on the assumption that each blockage recovery time satisfies exponential distribution. The performance of these two strategies are analyzed and compared in the paper.
出处 《数学的实践与认识》 CSCD 北大核心 2011年第21期128-134,共7页 Mathematics in Practice and Theory
基金 国家自然科学基金(71071002) 安徽大学学术创新团队资助(KJTD001B SKTD007B) 安徽大学青年科学基金(2009QN022B)
关键词 堵塞 恢复时间 随机 在线加拿大旅行者问题 竞争比 blockage recovery time stochastic online Canadian traveler problem competitive ratio
  • 相关文献

参考文献12

  • 1Papadimitriou C H, Yannakakis M. Shortest paths without a map [C]//Proc.16th ICALP, Lecture Notes in Computer Science, 1989, 372: 610-620.
  • 2Manasse M S, Mc Geoch L A, Sleator D D. Competitive algorithms for server problems[J]. Journal of Algorithms, 1990, 11(2): 208-230.
  • 3David S B, Borodin A. A new measure for the study of the on-line algorithm [J]. Algorithmic, 1994, ii(i): 73-91.
  • 4Koutsoupias E, Papadimitriou C. On the k-server conjecture[J]. Journal of Association for Corn-puting Machinery, 1995, 42(5): 971-983.
  • 5Alon N, Karp R M, Peleg D, et al. A graph-theoretic game and its application to the k-server problem [J]. Society for Industrial and Applied Mathematics Journal on Computing, 1995, 24(1): 78-100.
  • 6朱志军,徐寅峰.加拿大旅行者问题[J].系统工程理论方法应用,2003,12(2):177-181. 被引量:5
  • 7Su B, Xu Y f, Xu Y, Zhu Z j. online recoverable traveler problem on a road [J]. Information, 2004, 7(4), 477-486.
  • 8苏兵,徐寅峰.连续网络上的占线可恢复加拿大旅行者问题[J].系统工程,2004,22(8):10-13. 被引量:8
  • 9堵丁柱.k车服务问题与竞争算法[J].数学的实践与认识,1991,21(4):36-40. 被引量:40
  • 10Koutsoupias E, Taylor D S. The CNN Problem and Other k-server Variants [C]. In 17th Annual Symposium on Theoretical Aspects of Computer Science. Lille, France:Springer,17-19 February 2000.

二级参考文献37

共引文献56

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部