path problem中文是什么意思

发音:

中文翻译
造句

路程问题

path n. (pl. paths ) 1.(自然踏成的)路；路 ...
problem n. 1.问题，课题；疑难问题；令人困惑的情况。 2.【 ...
elementary path problem 基本路程问题
false path problem 错误路径问题
hamiltonian path problem 汉弥尔顿回圈问题; 汉弥尔顿路径问题; 汉米尔顿路径问题
minimal path problem 最小路径问题
shortest path problem 图论最短路; 最短道路问题; 最短路径; 最短通路问题
a problem 一道题; 一个问题
no problem 毫无问题; 考试家族; 没问题; 无问题
problem n. 1.问题，课题；疑难问题；令人困惑的情况。 2.【数、物】习题；作图题。 3.(象棋的)布局问题。 the problem of unemployment 失业问题。 His whole conduct is a problem to me. 他的一切行为我都不理解。 adj. 1.成问题的；难处理的。 2.关于社会问题的。 a problem child 【心理学】问题儿童；难管教的孩子。 a problem novel [play] (反映社会问题等的)问题小说[戏剧]。 sleep on [upon, over] a problem 把问题留到第二天解决。
the problem is 困难在於
by path 按路径; 旁通管旁路
by-path 小路，旁路，侧道，僻径。
no path 无路径
path path(ol.) ＝pathological; pathology. n. (pl. paths ) 1.(自然踏成的)路；路径；(马路边上的)人行道；(车子走不过的)小路；(竞走或自行车比赛的)跑道。 2.路线；路程；〔比喻〕(人生的)道路；(思想、行为、生活的)途径，方式。 3.【天文学】道，带。 approach path 【航空】进场航线。 moon's path 【天文学】白道。 path of a total eclipse 【天文学】全蚀带。 a path strewn with roses 撒满玫瑰的道路，安乐的一生。 a beaten path 踏出来的[走惯的]路；常规，普通方法。 break [blaze] a (new) path 开辟一条(新)路。 cross sb.'s path 碰见某人；挡住某人去路，阻碍某人。 set sb.on the right path 使某人走上正路。 path-breaker 开路人；闯将。 adj. -less 无路的，人迹未到的。
path by 旁通管
path the 道路报
the path 解脱道
problem-assessment and problem-solving 问题分析与决策
tip-in problem tip-in problem 猛踩油门问题
beam path path length 声程
c-path composite path 复合通路
path, path line 迹线
short path critical path 最短路径关键路径
a difficult problem 一道难题

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

Since adleman solve the hamilton path problem using dna molecules in 1994 , many mathematical problems were solved by self - assembly of dna such as matrix multiplication , addition , symbolic determinants
目前己验证有大量的问题可以通过dna计算来解决，最著名的当然是1994年science上发表的美国科学家adleman的七节点hamilton路径问题的dna计算解决办法。
Base on exist hardware and network equipment the grid computing experimental environment is constituted in this paper . the parallel dijkstra algorithm to solve the short path problem is tested in the experimental environment
本文在介绍网格计算基本理论基础上，在现有硬件环境下架构了globus试验平台，并在globus网格环境下测试了最短路径问题的并行dijkstra算法。
A checksum failure is an indication of an i o path problem and requires investigation of your hardware , firmware drivers , bios , filter drivers for example , virus software , and other i o path components to determine the root cause
校验和失败表示出现了i / o路径问题，并需要对硬件、固件驱动程序、 bios 、筛选器驱动程序（例如病毒软件）及其他i / o路径组件进行检查，以确定问题根源。
This subject will survey some of the applications of network flows and focus on key special cases of network flow problems including the following : the shortest path problem , the maximum flow problem , the minimum cost flow problem , and the multi - commodity flow problem
这个主题将审视一些网流的应用并集中焦点在以下网流问题的关键特殊情况:最短路径问题,最大流量问题,最少成本流量问题,和多元物品流量问题。
The collision - avoid path planning is designed based on the different and varied blocks and the matters which would be when working . for convex obstructer , a beeline judgment is design to solve “ z ” path problem , for concave obstructer , a new method is put forward to avoid endless loop
对于凸形障碍物,设计了对直线判断的方法,解决了“之”字形路线问题;对于凹形障碍物,提出了一种新方法解决“死循环”问题。
It first shows the building of stochastic , time - dependent network model , the description of k expected shortest paths problem , the demonstration of travel time probability distributions for the arcs in transportation area , and the calculation of expected travel time on path
本文首先给出了随机时间依赖网络模型( stdn模型) 、 k期望最短路径问题的形式化描述，并针对交通应用领域推导出弧耗费服从的概率密度函数，路径期望值的计算方法。
Hamilton problem is one of fundamental problems in graph theory , the following aspects are mainly focused on : cycle problem and path problem . in detail , they are mainly problems of hamilton cycle , cycle extensibility , longest cycle and hamilton path , hamilton - connectivity , panconnectivity , path extensibility , longest path etc . as to hamilton cycle problem , we have got many results
Hamilton问题是图论研究的基本问题之一，主要集中在以下两个方面：圈问题和路问题，具体地讲主要有： hamilton圈问题，圈可扩性问题，最长圈问题等以及hamilton路问题， hamiltonj ji问题，泛溯问题，路可扩性问题，最长路问题等
The find - path problem is then transformed into that of finding a collision - free path for a point robot among the cspace obstacles . however , the research experiences have shown that the cspace transformation is very hard when the following situations occur : 1 both the robot and obstacles are not polygons , and 2 the robot is allowed to rotate . this situation gets even worse when the robot and obstacles are three dimensional objects with various shapes
其根本问题有二：第一，这一方法只适用于机器人及障碍物形状均为2d空间的多边形，无法推广到3d空间的多面体和其它形状的3 d空间物体，从而表现为对机器人及障碍物形状敏感第二，这一方法只适用于机器人平动，而实际机器人都必然要包括转动的要求。
Concretely we discuss the application of the shortest path problem , traveling salesman problerm and project management method on the touring itinerary improvement of travel agency . furthermore , we explore the use of minimum spanning tree problem , overlaid problerm and maximum flow problerm on the touring itinerary improvement of scenic spots . and also enclosed detailed spreadsheet solutions
具体的，讨论了最短路问题、旅行商问题和排程问题在旅行社线路优化中的应用；讨论了最小支撑树问题、覆盖问题和最大流问题在旅游景区线路优化中的运用，并在附录中给出了详细的电子表格解法。