·2,447,543篇论文数据,部分数据来源于NoteExpress
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
针对通常的串行计算机的串行最短路径算法,几乎已经到达了理论上的时间复杂度极限。
Then, a computer system would often run one simple sequential program at a time, and nothing could interrupt it or vie with it.
那时, 计算机系统通常在同一时刻只能运行一个单独的程序,什么都不能打断它或者与它竞争。
Within the computer, it will merely be a sequential change of codes.
在电脑中,只是一些代号的连续变化。
应用推荐