• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Probability and Statistics Applied to the Theory of Algorithms
【24h】

Probability and Statistics Applied to the Theory of Algorithms

机译：概率统计应用于算法理论

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The work reviewed here is centered around the tools and results of probabilitytheory that contribute to the theory of algorithms, especially the theory of combinatorial optimization. The reviewed cites sixteen articles and three Ph.d. theses that were supported in part by ARO Grant DAAL03-91-G-0110 during the period of May 1991 to October 1993, including the optional third year (so the present report necessarily overlaps with the report filed in October 1992 that covered the first two years of the grant). The work surveyed includes work on the objective method which led to the the resolution with David Aldous of R. Bland's conjecture that the sum of the squares of the edges of the minimal spanning tree of a random sample from the unit square converges to a constant as the sample size goes to infinity, work with R. Stine on symbolic stochastic calculus, the NAS Panel Report Probability and Algorithms, work with T. L. Snyder on the worst case behavior of the traveling salesman problem, and work with Jun Gao on the spacefilling curve heuristics, as well as other work on probability and its relation to the theory of algorithms. (AN).

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号