该问题的解决算法在很多问题的解决中被使用,如巡视员问题,机器人的运动规划等等。
Algorithms for this problem have many use for solving a lot of problems, such as Watchman Route problems and Robot motion planning problem etc.
为了解决算法少数情况下的失效问题,深入研究和分析了一种修正算法——组合松弛算法。
In order to solve the failure of the structural index reduction algorithms in a few cases, another algorithm which is called combinatorial relaxation algorithm is analyzed and studied.
分析了判车过程中存在的矿车上下衡、车辆往复以及车辆抖动问题,结合矿山轨道衡的实际,提出了具体的解决算法。
We analyze the car harvesters and scale, vehicle and vehicle jitter, reciprocating dynamic weighing mines. Combining with practical, we put forward specific solution algorithm.
So I'm going to solve this by enumerate and check, which is an example of what's called a brute-force algorithm.
你懂的,所以我得靠列举和检验来解决这个问题,这就是我们说的穷举算法。
Now, as obvious a statement as that is in this algorithm, it turns out that is the key to this whole problem being solved correctly without my algorithm looping infinitely.
这是此算法中很明显的一句话,也是正确解决,整个问题的关键,否则此算法就会陷入死循环。
OK. Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean? It says, in order to solve a problem, cut it down to a smaller problem and try and solve that one.
好了,二分搜索也许是,最简单的分治算法,这意味着什么?,也就是说,为了解决一个问题,把它切割成小的问题,然后再来一个个解决。
应用推荐