Yet somehow, nature is able to simulate this mathematical problem using only N particles.
然而不知为什么，大自然能仅使用N粒子模拟这一数学问题。
Not all instances of the N+1 problem are as readily perceived.
并非所有的N+1问题都能很容易地察觉到。
With the N-Tier improvements for Entity Framework, we want to address some of the same problem space as DataSet, but we want to avoid the primary issues with it.
随着对EntityFramework进行N层改进，我们想解决一些相同的问题空间，例如数据集，但要避开它一些主要问题。
I've addressed the problem of reusability above, but I still need to get rid of that N-to-1 dependency.
我在上面解决了重用性的问题，但是仍然需要避免n对一的依赖关系。
For example, a new patch becomes available for a specific device type or class of devices (when, say, just the game version for the N-Gage has a problem).
例如，假设发布了针对特定设备类型的一个补丁(比如由于针对N - Gage的游戏版本出现了一个问题)。
As illustrated in the Fortran example, the benefit of auto-vectorization grows as the problem size is increased, reaching a factor of 6.00x at n=2000.
正如在Fortran范例中演示的那样，自动向量化带来的好处随着问题规模的增加而增加，最后当 n=2000 的时候达到了。
If I'm running at nanosecond speed, 1000 n, the size of the problem, whatever it is, is 1000, and I've got a log algorithm, it takes 10 nanoseconds to complete.
如果这个问题的规模，也就是n，是，如果这个问题是对数级的，这将会占据10纳秒的时间，你一眨眼的时间。
This problem is the dreaded N + 1 problem.
这就是可怕的N +1问题。
When I look at Ruby, I perceive a balance between different design goals, a complex interaction reminiscent of the n-body problem in physics.
当我观察ruby，对于一个复杂的物理学上n - body回忆者问题，我觉察到了不同设计目标的一种平衡。
Consider also the n(n-1) integration problem.
同样考虑n（n-1）集成问题。
Eager evaluation can also help with the n+1 Selects Problem.
即时抓取还有助于解决 n+1选择问题。
A. N. Whitehead, in his Adventures of Ideas, has the answer which comes near to solving the problem.
怀赫德在他的著作《理念的奇遇》一书中所提出的答案，近乎可以解决该问题。
This article gives three algorithms for all permutations of 1 to N, analyzing the application of this problem in stack and enumeration of binary tree.
文章给出了1至N全排列问题的三种求解算法，分析了该问题在栈及二叉树计数中的应用。
Searching an optimized executive strategy for every complex query is the key of success for database development. In database field, it is still an N-P problem.
对于一个复杂的查询，寻找一个优化的执行策略是数据库系统开发成功的关键所在，此项研究目前在数据库领域仍属于N - P问题。
The optimal design for a kind of sequencing problem of N-set is investigated, and the least substitution times of the converse ordinal of N-set is obtained.
研究N元集的一类排序问题的最优设计，得到了N元集逆序排序所需的最少抽换次数，同时也给出了相关的结果和算法的实。
Traditional backtracking algorithm has been improved by rotating the chessboard matrix and put into solving N-queens counting problem in computer cluster.
通过对n皇后问题棋盘矩阵的旋转，改进了回溯算法，并通过计算机集群并行实现了N皇后的计数问题。
This method almost immediately gives a solution to N-puzzle problem, however it is usually not the optimal one.
解法能在很短时间内给出N数码的一个解，不过这个解通常不是最优解。
"I like In-N-Out Burger and Taco Bell and if you want to make that pregnant that's your problem," she said, "I still love drinking alcohol so not yet."
“我喜欢吃汉堡还有墨西哥鸡肉卷，你要是把这个当成怀孕，那就是你的问题了。”她说，“我还是很爱喝酒，所以时机还未到。”
Velocity sections are shown by electric computer. The studying in this paper not only make N—S function add a exact solution but also have practical value for engineering problem.
本文的研究结果使粘性流体力学中的N—S方程又增添一例准确解，对工程实践中的具体问题有实用价值和指导意义。
So the running time of the problem where the input is T of size N as expressed here formulaically, T of N, the running time of an algorithm, given an input of size N. You know what?
因此一个输入为N的问题的运行时间，在这儿的公式表示为，如果输入为N，那么此算法的运行时间，是多少呢？
It 's important in many science and engineering applications to reduce the execution time of the N-body problem on workstation clusters by effective scheduling policies.
采用合理的任务调度策略能有效地降低N体问题求解时间，对大量科学与工程应用具有重要意义。
"That would not be a problem at the n. T. S. B.," he said. "If the board found that a part needed to be recalled, they would make that recommendation."
“这在美国国家运输安全委员会内不算什么问题，”他说道，“如果委员会发现了飞机的某些部件需要召回，他们就会发出相应的通知。”
Based on the N-person cooperative game theory, this paper puts forward a model of the minimum cost allocation of transportation problem.
本文对运输问题的原设-对偶算法运用推拉流思想进行改进，得到一个拟多项式时间算法。
Five regular polyhedron solutions are given by analysing commonness of other special solutions of N-body problem.
分析n体问题一些特解的共性，给出5个正多面体解。
N-body problem is a problem researching on the universal gravitation between celestial bodies, this problem belong to the category of parallel calculation.
体问题是研究天体间万有引力的问题，属于易并行计算的范畴。
Soil erosion is the main cause for the global land degradation and also is the key problem resulting in the ecological environment deterioration, so N. n.
土壤侵蚀是土地退化的主要原因，也是导致生态环境恶化的最严重的问题，联合国粮农组织将其列为全球土地退化的首要问题。
This problem of a fifth power mean value computing formula of base 3 digits sum has been solved, and an exact calculation formulaA5(N)has been obtained.
主要解决了三进制之和函数五次均值的计算问题，得出了一个精确的计算公式。
N-body problem is a problem researching on the universal gravitation between celestial bodies, this problem belong to the category of parallel calculation.
N体问题是研究天体间万有引力的问题，属于易并行计算的范畴。
N-body problem is a problem researching on the universal gravitation between celestial bodies, this problem belong to the category of parallel calculation.
N体问题是研究天体间万有引力的问题，属于易并行计算的范畴。
应用推荐