通用有效的解决方括号中最短路径问题的方法
Generic and Efficient Solution Solves the Shortest Paths Problem in Square Runtime
摘要:
本文研究了一组新的方法来解决一个开放问题,即给定固定权重实例上的最短路径问题。在相当高的高度上,达到我们的目标,以满足我们通常对方法论所要求的通用性,效率,精确性的这些品质,这是真正的意义。除了证明我们的措施可以正常工作,我们更感兴趣的是根的计算和逻辑的重要理论,有利于我们的扩展到广泛的领域,决策,经营者,经济,管理,机器人,人工智能等。
英文摘要:
We study a group of new methods to solve an open problem that is the shortest paths problem on a given fix-weighted instance. It is the real significance at a considerable altitude to reach our aim to meet these qualities of generic, efficiency, precision which we generally require to a methodology. Besides our proof to guarantee our measures might work normally, we pay more interest to root out the vital theory about calculation and logic in favor of our extension to range over a wide field about decision, operator, economy, management, robot, AI and etc.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。