您要查找的是不是:
- Edsger Wybe Dijkstra 迪克斯特拉
- Edsger Dijkstra would not have liked it. 你是否想要回应?
- Goto fell into true disfavor with the publication of the famous "Goto considered harmful" paper by Edsger Dijkstra,and since then goto-bashing has been a popular sport,with advocates of the cast-out keyword scurrying for cover. 随着Edsger Dijkstra著名的“Goto有害”论的问世,goto便从此失宠。
- In Dijkstra's "goto considered harmful" paper,what he specifically objected to was the labels,not the goto. 在Dijkstra的“Goto有害”论中,他最反对的就是标签,而非goto。
- Based on Dijkstra's algorithm, the routing engine maintains two sets of routing groups. 根据Dijkstra的算法,路由引擎维护两个路由组集合。
- The routing engine uses the Dijkstra shortest-path algorithm to make routing decisions. 路由引擎使用Dijkstra最短路径算法来制定路由决策。
- In Dijkstra's "goto considered harmful" paper, what he specifically objected to was the labels, not the goto. 在Dijkstra的“Goto有害”论中,他最反对的就是标签,而非goto。
- Because of the customer to be only in FCL, this paper uses Dijkstra Algorithm to apply for this direct transportation. 由于整箱货物配送客户唯一,配送方式为直达式运输,本文采用Dijkstra算法。
- While n>4,the performance of SPDOA is distinctly better than the ones of Dijkstra,the dynamic characteristic is excel. 当n>4时,SPD OA算法的性能明显优于Dijkstra算法,呈现出良好的动态优化特性。
- Dijkstra algorithm based on quadheap PRI has already been realized in geography information system. 基于四叉堆优先级队列的·Dijkstra算法,是己经在地理信息系统中得以实现的一种算法。
- Computer Science is no more about computers than astronomy is about telescopes. -Edsger Dijkstra. 本文本身就过于强调技术,技术是计算机专业的学生必须要学的,但是全部吗?
- Industrial designer Jan Dijkstra made this wire kitchen as his graduation project from the Design Academy Eindhoven. 这样的铁丝框架厨房很有创意,移动起来很方便,适合用在房车上吧。
- A computation based on Dijkstra's algorithm is used to calculate the shortest path tree inside each area. 著名的迪杰斯特算法被用来计算最短路径树。它使用“成本”作为路由度量。
- This paper proposes a simple scalable QoS routing algorithm-single mixed metric based on link_states, SMM_LS for short, which is a modified Dijkstra algorithm. 本文提出了一种简单的可扩展性QoS路由算法Single Mixed Metric based on Link-States,简称SMM_LS算法,是改进的Dijk-stra算法。
- Dijkstra algorithm was a classic one. But the effectiveness of the algorithm was not good enough to meet the expectation of real-time search in a real road map. Dijkstra算法是一种经典的路径算法,但是这种算法的效率不高,不足以满足在真实交通网络图中搜索的实时响应的要求。
- Based on Dijkstra and A* algorithms,ellipse curve parameter is used to initialize the initial value of the A* heuristic function,and the searching nodes are reduced. 采用二叉堆结构来实现路径计算过程中优先级队列的一系列操作,从而提高了算法的执行效率。
- It provides one path based on driver's route choice behavior between origin and destination arbitrarily without alternatives through Dijkstra's algorithm. 透过模糊类神经的演算,使系统能够根据驾驶者的经验去学习驾驶者的决策逻辑,让系统更加适性化。
- Firstly we seek the path of network from the starting Net PC to the destination device,according to Bellman?Ford algorithm if RIP protocol is running in the autonomous system and Dijkstra algorithm if OSPF protocol is active. 该技术的实现分为两大部分:在网络寻径的基础上定位故障,即在配置了RIP协议的自治系统内,根据RIP协议的实现算法Bellman Ford确定两个网络工作站之间的链路,若自治系统配置的是OSPF协议,则根据Dijkstra算法寻径,再编程实现Ping命令功能来迅速定位故障;
- According to the characteristic of city traffic and the Dijkstra algorithm,an algorithm which is calculated by the travel time is introduced to satisfy the requirements of drivers. 基于城市快速路实时管理和控制的思路,利用观测断面的数据,给出动态预测网状城市快速路上的交通状态和任意两点间行驶时间的方法。
- When we calculate the shortest route of the network by classical Dijkstra arithmetic,we need to calculate the route-lengths between nodal points which are unrelated to the shortest routes. 结合激光切割最短路径的计算问题,将模糊聚类分析与遗传算法相结合,提出了一种分级搜索最短路径的方法,该方法对于同类问题的解决具有借鉴作用。