Such platforms can both enable large-scale, syndicated problem solving not attainable through algorithms, and concurrently circumvent labor laws by offering compensation below statutory hourly wages.
在这个平台上，特克们每完成一个“脑力任务”（MITs）就可以得到一些物质补偿。 这种平台既可以解决用演算法不能解决的大范围综合性问题，同时也可以通过提供低于最低时薪的工资避免触犯劳动法。
Then Traveling Salesman Problem is described and its mathematics model is provided. Some correlative algorithms are introduced and their capability of solving TSP is compared.
随后叙述了TSP的一般提法，描述了其数学模型，综合介绍了关于解决TSP的相关算法，并做了性能比较。
Because of its huge scale and complicated limitations, intelligent algorithms have been widely applied in solving this problem.
由于这类问题规模庞大并且限制因素复杂，所以智能算法在此问题得到广泛运用。
It is more suitable than simulated annealing and genetic algorithms for solving the problem that presents many local minima. Experimental results show the method is efficient.
本算法比遗传算法和模拟退火算法更适合于解决具有很多局部最小值的冗余传感器系统费用优化的问题，仿真实验结果表明本算法是很有效的。
This paper discusses algorithms of the shortest path in a weighted graph as well as the shortest path transformations resulted from it, and gives a simple program solving problem of MATLAB.
讨论了一个带权图的最短路径的算法及其若干个变形问题的算法，并在MATLAB软件环境下对最短路径问题给出了一个简捷易懂的程序。
And then the paper gave the filtering algorithms for solving the problem of in-coordinate interval and measurement delay.
然后在此基础上，提出了采用非等间隔并解决滞后的滤波算法以解决上述问题。
As part of the course, we will briefly examine the effect of programming paradigm choice on problem-solving approaches, and introduce data structures and algorithms.
我们将简要的检视选择开发方式对解决问题的方法，所造成的影响，并介绍资料结构及算法。
Taking transmission design of armored vehicles as an example, this dissertation does research on Resource-Constrained Project Scheduling Problem (RCPSP) for product design and the solving algorithms.
本文以装甲车辆传动装置设计为例，研究产品设计资源受限项目调度规划方法和优化调度问题求解算法。
Multiple Sequence Alignment (MSA)has great importance in the field of Bioinformatics, MSA is a typical NP-Complete problem, and genetic algorithms (GAs )is the perfect method for solving NP-Complete.
多序列联配（MSA）在生物信息学研究中占有重要地位，MSA问题是一个典型的NP问题，遗传算法是求解NP完全问题的一种理想方法。
The precise and approximate algorithms solving 0-1 knapsack problem, precise algorithm could not be used to solve 0-1 knapsack problem in a short time, so it could not be applied extensively.
求解0 - 1背包问题的精确算法不能在较短时间内求解大规模0 - 1背包问题，使其实用性受到限制。
An example was tested and showed immune algorithm has good searching performance, and it is efficient for solving unit commitment problem compared with other optimization algorithms.
经实例验证表明，优化免疫算法具有良好的搜索性能，是解决机组优化组合问题的有效方法。
Algorithms for this problem have many use for solving a lot of problems, such as Watchman Route problems and Robot motion planning problem etc.
该问题的解决算法在很多问题的解决中被使用，如巡视员问题，机器人的运动规划等等。
Algorithms for this problem have many use for solving a lot of problems, such as Watchman Route problems and Robot motion planning problem etc.
该问题的解决算法在很多问题的解决中被使用，如巡视员问题，机器人的运动规划等等。
应用推荐