查询词典 shortest path problem

The common people does everything possible to need to be grasping its evidence that can be got hold of in lawsuits or arguments , can claim indemnity one, evidence that can be got hold of in lawsuits or arguments does not also need to set aside bone , the bone should not also be very many set aside ice; Reporter who has chosen bone with a covetous look that is to big news having speculation value absolutely , the problem does not also need to create problem, in that USA does not become a problem's filter oil powder having arrived at China is a problem, being put into use filtering oil powder is pinker than being needless to filter oil also being problem , nonutility therefore in the homeland the eatery is fundamental, that the common people knows this neither is what thing.

老百姓想方设法要抓着它的把柄，可以索赔它一笔，没有把柄也要挑出骨头，没有骨头也要挑出冰太多；记者虎视眈眈谁挑着了骨头那绝对是有炒作价值的大新闻，没有问题也要创造问题，在美国不成为问题的滤油粉到了中国那就是个问题，使用滤油粉比不用滤油粉更是个问题，所以国内餐馆基本不用，老百姓也不了解这是个什么东西。

In the real life, have some to grow similarity since new problem and the old problem are general, unknown object and the known number object get in touch with always mutually, be on basis observing carefully in new problem , overwear knowledge , come to handle the new problem old experience, this thought is that process it is have purpose's , effective conversion contradiction, to solve a problem ultimately change solving problems that process , the mathematics inscribe one kind , is to change from saying , solving problems on this significance melt return to

中文摘要：在实际生活中，由于新老问题总有某种相似之处，未知的事物与已知的事物总是相互联系的，即在新问题仔细观察的基础上，用旧知识、旧经验来处理新问题，这种思维是一种转化过程，数学题的解题过程就是有目的的、有效的转化矛盾，最终解决问题，从这个意义上说，解题就是转化。

Based on the study on the traveling salesman problem, in this dissertation, some results on the solving of production scheduling problem using the neural networks are described, which includes the following main parts: l The method which was put forward by Hopfield－Tank of solving the traveling salesman problem is analyzed, and the drawbacks of the method are pointed out. The interlinks between optimal tours and city distribution in the clustering and divide and conquer method are analyzed. A parallel network algorithm on the problem of the traveling salesman problem is presented.

主要包括以下几个方面的内容： 1对Hopfield和Tank提出的解决旅行商问题的方法做了分析和研究，指出该方法的严重不足；对于用聚类方法和各个击破的思想解旅行商问题，分析了最优路径与城市分布之间的几个关系；提出了一个解决旅行商问题的并行网络算法，由这一算法得到的解是&or-optimal&路径。

The algorithm has some problems, such as bias problem, aliasing problem and one problem that affects none-shade part of image and is caused by Gaussian blur. To solve these problems, this paper makes some improvement on the algorithm. Firstly, it uses the Woos average depth principle and PCF algorithm to solving bias problem and aliasing problem; secondly, it designs and implements an effective method to control the range of blur; thirdly, it adapts any size texture to story information. This method for keeping information plays important part on raising realistic graphic; fourthly, it takes use of the technology of programmable graphics hardware and the method of FBO to improve efficiency of algorithm.

由于基于高斯模糊的阴影算法存在阴影走样、量化误差和高斯模糊影响非阴影部分图像等问题，因此本文从以下几个方面对算法进行了改进：第一，在算法中添加了woo的平均深度值原理和PCF算法，改善了量化误差和阴影走样问题；第二，设计并实现了一种方法，有效地控制了高斯模糊的范围，提高了三维图形的真实感；第三，使用任意大小的纹理进行存储，提高了阴影的真实感；第四，通过可编程图形硬件技术的应用，提高了算法的运行速度。

Adopting speech record analysis by making a sound while thinking ,aiming at Organic Chemistry test questions and doing a lot of individual case analysis, The author summarizes the successful problem-solving thinking strategy for outstanding students of Organic Chemistry questions then edites the successful problem-solving thinking strategy for outstanding students as a teaching plan and trains consciously the students in the experiment team adhibiting the problem-solving thinking strategy for Organic Chemistry in the usual teaching practice activities to find out the characteristics of students" problem-solving thinking activity in Organic Chemistry and to improve the students" ability of problem-solving in Organic Chemistry rapidly.

然后，将优生成功解题的思维策略编成教案，在正常的教学实践活动中，有意识地对实验组学生进行有机化学问题解决思维策略训练，以了解学生有机化学解题思维活动特征，促进学生有机化学问题解决能力的迅速提高。实验以株洲六○一中学高三年级理科两个班的学生为被试，以自编《高中有机化学问题解决能力检验的前测和后测试题》和自编《高中生有机化学解题思维策略训练教程》各1套等为材料，通过6周的教学训练，收集训练前、后有机化学测试成绩等数据，采用SPSS10.0进行统计分析，得出如下研究结论： 1、对高三年级学生进行有机化学解题思维策略训练能有效地提高其有机化学解题能力。

Thirdly, we examine a job scheduling problem, in which jobs could be processed by multiple in-line steppers. This problem includes two decisions: job assignment and job sequencing. Through developing a new and concise representation scheme for modeling the two decisions, we solve the multiple-machine scheduling problem by various meta-heuristic algorithms. The preceding single-machine scheduling problem in fact is a special case of the multiple-machine scheduling problem.

第三部分探讨在多机情境下，求解工件排程问题，在此情境下产生两个决策变数：工件指派给各机台，以及工件在机台内的排序问题；为了解决此问题，本研究透过新的染色体设计，能同时代表此两个决策变数，使得解题空间变小，求得更好的解题品质。

Concept of the feasible process graph for a part was defined and the mathematic model of multi-process routes decision-making problem was set up. Thus, the problem of multi-process routes decision-making was transformed into the problem of searching optimum path in this directed graph.

给出了零件可行性工艺路线图的概念，建立了多工艺路线决策问题的数学模型，从而将零件的工艺路线规划问题转化为对零件可行性工艺路线图中具备最优值的路径搜索和寻优问题。

When solving the TNA problem based on fleet balance application, a flight pairing network model is build, by which the primary problem transferred to a directed path decomposition problem to minimize target function, and a simulated annealing algorithm is constructed.

在解决使飞机均衡使用的飞机排班问题时，本文利用航班节的网络模型将原问题转化为一个使目标函数最小的航班节编组问题，在此基础上构造了一个模拟退火算法。

Nowadays many researches have focused on structural ET based on statement and branch coverage and there are few researches on path-oriented ET. To solve this problem, this paper provokes an approach to construct the fitness function for test case generation in path-oriented ET based on the similarity evaluation techniques.

为了解决目前结构性演化测试主要集中于面向语句、分支等覆盖标准，缺乏面向路径覆盖标准的问题，提出了基于相似性度量的适应值函数构造方法，以用于生成覆盖指定路径的测试用例。

Given a ring and a set of communication requests. Each request is represented by a pair of nodes, and associated with a profit. To satisfy a request in the undirected ring, we need to determine a path between the two nodes of the request in the ring. To satisfy a request in the directed ring, we need to determine a directed path from the source to the destination of the request in the directed ring. The goal of the call admission control problem is to determine and satisfy a maximum profit subset of the requests such that for every edge of the ring, the number of satisfied requests that are routed through the edge does not exceed the capacity of the edge.

要在无向环中实现一个呼叫，需在环中指定该请求所对应的两个顶点之间的一条路，要在有向环中实现一个呼叫，需在环中指定该请求的源节点到目的节点的一条路，环网络呼叫接纳控制问题的目标是确定最大利润的呼叫子集，在环中实现该子集中的每一个呼叫，使得经过每一边的呼叫的数目不超过该边的容量，对于无向和有向环网络呼叫接纳控制问题，我们均首次给出了多项式时间近似方案。

Aquatic or marsh-growing fern allies; known to have existed since the Cenozoic; sometimes included in Lycopodiales.

生活于水中或湿地的蕨类；从新生代生存至今；有时归于石松目之中。

The engine was uprated from a 90hp Franklin to a 125hp Lycoming.

改良过的引擎是从90hp到125hp莱康明富兰克林。