Without any power adaptation, the problem becomes a typical one dimension maximum problem.
在无功率控制时，问题简化为单一变量的极值问题；
An experimental calculation based on the proposed matching selection for a maximum problem was performed.
以这种配对方式为基础，对一个极大值问题作了计算机模拟。
The maximum problem of parametric yield in VLSI is always an important issue in design for manufacturing (DFM).
超大规模集成电路(VLSI)中的参数成品率最优化问题一直是集成电路可制造性设计的重点研究问题。
So how would we go about solving this problem if I told you not only was there a maximum weight, but there was a maximum volume.
有些时候两个都重要，所以如果我告诉你这里不仅有，最大重量还有最大容量，我们应该怎么解决这个问题呢？
Increasing the maximum connection pool size might help to alleviate the problem.
增大最大连接池大小可以帮助缓解此问题。
Another problem is that precision fields only specify the maximum size of one parameter, but buffers need to be sized for the maximum size of all data combined instead.
另一个问题在于，精确字段仅指定一个参数的最大长度，但是缓冲区需要针对组合起来的数据的最大尺寸调整大小。
On one hand, to maximize the chances of being able to determine the cause of a problem upon its first occurrence, you want to gather the maximum amount of diagnostic data from the system at all times.
一方面，为了尽最大可能在问题第一次出现时确定导致该问题的原因，您希望在任何时候都不断地收集系统的尽可能多的诊断数据。
Your main objective should be to gather a maximum amount of diagnostic information just before and around the time of a problem.
您的主要目标应该是在问题发生前和发生时，收集尽可能多的诊断信息。
This produces the maximum that we wanted to solve the problem, and of course prints out the answer.
这会产生我们想要的最大数，当然还会打印出结果。
The problem of scheduling jobs with non-identical sizes on parallel batching machines is considered; the objective is to minimize the maximum completion time (makespan).
考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。
This option will require the maximum amount of run time, but can potentially provide the most insight into an infeasibility problem.
这个选项将需要相当多的时间来运行，但能潜在提供最深入地剖解不可行问题。
If the maximum detection time is required to be minimal, the problem is proved to be NP completeness and an approximate algorithm is given.
若要求最大检测时间最小，证明了其是NP完全问题，并给出近似算法。
So then, the problem of the Concept of Life and Death is the maximum puzzle in sprit and thought, which everybody must face up to in the process of growing up and getting education.
生死观的问题，是每一个人在成长和受教育过程中，必须面对的一个精神上、思想上的最大困惑。
This problem is a generalization of the problem of finding the maximum cardinality clique of an unweighted graph.
这个问题是寻找无权图的最大团问题的推广。
For the Four Via routing algorithm used in MCM routing, the maximum weighted non crossing match problem should be solved.
四通孔布线算法用于实际MCM布线时，需要解决最大加权不相交匹配问题。
Mining and updating maximum frequent patterns is a key problem in data mining research.
挖掘和更新最大频繁模式是多种数据挖掘应用中的关键问题。
The problem of maximum likelihood detection is also studied, and no correlation is only a special case of correlation.
并研究了衰落相关条件下的最大似然检测问题，无衰落相关只是有衰落相关的一种特殊情况。
Then, a cluster centroid splitting strategy is proposed based on maximum distance to resolve the problem of selecting cluster centroid.
之后提出了一种基于最大距离的聚类中心分割策略，来解决聚类中心的选取问题。
Mining maximum frequent patterns is a key problem in data mining research.
挖掘最大频繁模式是多种数据挖掘应用中的关键问题。
To solve the problem of calculate maximum power in power system restoration process, the paper proposes the method of combined of flow calculation and sensitivity.
针对电力系统恢复过程中最大功率计算问题，提出了将潮流计算和灵敏度分析相结合的方法。
The condition of the existence of solution of functional extreme value problem applied to maximum thrust nozzle is also presented.
同时，还导出了最大推力喷管这个泛函极值问题解存在的条件。
The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最大团问题是组合优化中的一个经典的NP -完全问题。
In the simulation process, the author found that the maximum entropy method exists overflow problem, and the problem was successfully resolved by variable change method.
在仿真实现过程中，发现最大熵方法存在溢出的问题，通过变量变化法成功解决了此问题。
Mark the "level 10" box above each of the years when your problem hit its maximum.
在当你的问题最大花的时间年份上方的“10”格子做记号。
A new algorithm for the maximum clique problem has been presented in this paper, the local enumerative algorithm based on average degree sorting.
提出了关于最大团问题的一种新思路基于平均度排序的局部枚举算法。
Based on the study of the structure of maximum plane graph, with normal mathematic reasoning, this thesis studied the color number problem of maximum plane graph.
以极大平面图的结构研究为基础，采用常规的数学推理方法研究极大平面图的点色数问题。
Then the segmentation problem is formulated as Maximum a Posterior Probability (MAP) estimation rule.
分割问题可以被转换成一种最大后验概率估计问题。
Then the segmentation problem is formulated as Maximum a Posterior Probability (MAP) estimation rule.
分割问题可以被转换成一种最大后验概率估计问题。
应用推荐