查询词典 problem

The rational points of an elliptic curve forms an additive group. The discrete logarithm problem of this group is called elliptic curve discrete logarithm problem.

椭圆曲线上的有理点会形成一个加法群，此加法群上的离散对数问题称为椭圆曲线离散对数问题(elliptic curve discrete logarithm problem)。

The vehicle scheduling problem is the very core of the content in the logistics scopes, it is a typical NP-hard problem, involving in many research subjects such as operations research, applied mathematics, combinatorial optimization, network analysis, computer software, computer applications, logistics science, transportation management, etc.

车辆优化调度问题(Vehicle Scheduling Problem，简称VSP)是物流配送中的最为核心的内容，它是一个典型的NP难题，涉及到运筹学、应用数学，组合优化、图论与网络分析、计算机软件、计算机应用、物流科学、运输管理等众多学科领域。

Vehicle routing problem is a typical combinatorial optimization problem, which is a simplified form of various complex problems.

车辆路径问题( Vehicle routing problem，简记VRP)是一个经典的组合优化问题，是多种复杂问题的一种简化形式。

Players can opt to play as the big boys in the conflict or try for a more limited involvement with a minor power like Siam, Norway, the Balkans or the Dutch East Indies. All the civs make the Foreign Advisor screen a little crowded, but you 32-player types should have no problem with it.

玩家可以选择游戏中的巨人或是比较弱小的国家进行有限的牵涉，比如泰国、挪威、巴尔干地区和荷属东印度（所有的国家将使你的外交顾问界面变得有点拥挤，but you 32-player types should have no problem with it不明白

In this paper, a code TFEM-2D (Triangular Partition, Finite Element Method Two-dimensional Problem) for the few-group, two-dimensional, geometrical neutron ...

本文在FELIX C－512计算机上用FORTRAN Ⅳ语言编制了在、几何下的二维少群中子扩散程序TFEM－2D（Trianglular Partition； Finite Element Method Two－dimensional Problem）。

Graph Coloring Problem is one of the typical NP-hard problems in combinatorial optimization problem.

图着色问题（GCP，Graph Coloring Problem）是经典的NP-Hard组合优化问题之一。

Based on the study of using the evolutionary computing to solve the Multiple Depot Capacitated Arc Routing Problem, its mathematic model was improved, so as to satisfy the demand of the sprinkler routing problem in real world.

在利用进化计算对多车场带有容量限制的弧路径规划问题(multiple depot capacitated arcrouting problem， MDCARP)进行研究的基础上，对其数学模型进行改进，以适应现实生活中洒水车路径优化问题的需要。

These things I can leave alone for this VFS-problem as they are not related to the partition access problem we are looking at.

这些东西我能单独留下VFS-problem因为它们与我们关注分区访问问题没多大关系。

Quadratic assignment problem is a NP-hard combinatorial optimization problem and has been applied in various fields. There are always many zero elements in the flow matrix or distance matrix of the quadratic assignment problem instances which are abstracted from the practical problems. Much computation time can be saved if we can first reduce the size of the problem by using its zero elements.

二次分配问题(quadratic assignment problem， QAP)是应用于诸多领域的组合优化NP-难题，许多从实际问题中抽象出来的二次分配问题，其流矩阵与距离矩阵中存在大量零元素，如果在该类二次分配问题的求解中，能够充分利用这些零元素的信息，将大大缩减问题的规模，节省大量运算时间。

Traveling Salesman Problem is a classic NP problem, which is the main standard of measuring the efficiency of approximative algorithms. So the solution of the problem has has very important significance.

Traveling Salesman Problem问题是一个典型NP难题，是衡量近似算法效率的主要标准，因此设计TSP问题的近似算法具有非常重要的意义。

Next time I see you,I shall give you a black eye.

下次我看见你，我会打你一顿。

In this paper,design scheme of classification system of wood surface color is established.

提出了木质板材颜色分类的系统设计方案。