• Nmax, the matrix size N that gives the highest flops.

    得出最高flop 时所使用的矩阵大小N

    youdao

  • And how about if the array is size n, and I say bracket n, where am I referring?

    如果那个数组大小n,那会怎么样指明涉及到了那个地方

    youdao

  • 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,那么此算法的运行时间,是多少呢?

    youdao

  • 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 的时候达到了。

    youdao

  • 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秒的时间,你一眨眼的时间。

    youdao

  • On the other hand, we've seen n that if the size of a is n, that's to say, we have n elements to choose from, then the number of possible subsets is 2 to the n.

    一方面,我们看到,如果a集合大小,也就是说我们n元素可供选择而可能子集元素,个数就是2n次方。

    youdao

  • The input array is first divided into N partitions of roughly equal size, where N is the number of logical CPUs.

    输入数组首先大致均等划分N分区这里N逻辑CPU数目

    youdao

  • To generate an AME report for workload planning by modeling a minimum uncompressed pool size 700 MB with only 3 entries in the modeled table, -u andn options are used.

    通过建模最小未压缩大小 700MB建模仅有3 个条目工作负载规划生成AME报告可以使用-u -n选项

    youdao

  • In addition, instead of using short names for tags and attributes like s and n, you can change them to size and name, respectively (see Listing 7).

    此外如果标签属性愿意使用名字sn可以分别修改sizename(如图7所示)。

    youdao

  • So if we're keeping n the same, we look and what we saw was that size actually decreases as we increase the value of l.

    如果我们保持n不变,我们看到随着l,增大尺寸变小

    youdao

  • The results showed that mass mean diameter (MMD), and drop size distribution parameter N changed with pressure drop, air velocity, and fuel viscosity.

    结果表明,液雾的质量中间直径MMD尺寸分布参数N随着喷嘴压力空气流速燃油性质而变化

    youdao

  • Besides temperature and concentration of reaction, the heating rate plays an important role on the size and morphology of n-HA crystals.

    研究发现在反应物浓度及配比一定情况下,反应温度升温速度纳米ha晶体尺寸形态重要影响

    youdao

  • An exact shell clack sheet's geometric size calculation is the most important link n he design of manufacturing a spherical vessel.

    精确球壳下料尺寸计算设计制造球罐重要一环

    youdao

  • The first line of each test case contains two integers m and n, indicating the size of the maze.

    每个测试案例第一包含两个整数MN表明迷宫大小

    youdao

  • The crystalloid of n-HSF/PP Composite decreases in size comparing with pure PP via PLM investigation.

    通过偏光显微镜照片发现复合材料晶体尺寸聚丙烯减小

    youdao

  • The chain length distribution of a oligomeric polystyrene sample initiated by n-butyl lithium was determined by high performance size exclusion chromatography on a ultraviolet absorption detector.

    高效尺寸排除色谱紫外吸收光度计寿检测器测定一个以正丁基引发聚苯乙烯齐聚物分布

    youdao

  • Assuming allocates and frees run in constant time, this enlargement process takes o (n) time where nis the current size of the array.

    假设分配释放需要常量时间这个扩容动作花费O (n)时间,这里n当前数组的大小

    youdao

  • In the continual observation, size-fractionated dissolved organic N and P had similar trend with their inorganic counterparts.

    连续观测中,各形态溶解有机的变动趋势无机态较为接近。

    youdao

  • Skips n blocks (using the specified output block size) form beginning of output file before copying.

    拷贝文件时,指定输入文件开始记录号。

    youdao

  • Numerical simulation shows that the time-step size can be set 100 times as large as that of the conventional FDTD method, while the C-N FDTD algorithm is still unconditionally stable.

    例也表明了当时间长取为常规FDTD时间步长100时,该算法仍然无条件稳定

    youdao

  • There are two sorted arrays A and B of size mand n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

    这个有序数组中间数,其实这个中间数,如果奇数,就是中间的那个,如果是偶数,就是中间两个数的和的平均值。

    youdao

  • With the improvements in the data structure and realization, the algorithm took O(NlogN)time, where N is the input size.

    经过数据结构实现方式上的改进算法总体平均时间复杂度ONlogN)。

    youdao

  • With the improvements in the data structure and realization, the algorithm took O(NlogN)time, where N is the input size.

    经过数据结构实现方式上的改进算法总体平均时间复杂度ONlogN)。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定