这些是可能发生的，只有随着时间的过去，团队在进行用例实现会议时所获得的经验可以最小化，或者甚至消除这些问题。
These are to be expected; only the experience a team acquires over time as it conducts use-case realization sessions can minimize or even eliminate these problems.
它将假阳性因素最小化，使结果更加容易理解，从而比增加监测幅面有更高的优先权：这样有助于帮助开发人员尽早发现问题，并且节省了时间。
It minimizes false positives and makes results easy to understand as a higher priority than increasing the breadth of a scan: this helps developers uncover issues early only as long as it saves time.
应用修订包可以主动阻止潜在的问题，也有助于最小化与DB 2相关的应用系统的宕机时间。
Applying fix packs allows you to be proactive in preventing potential errors, and it also helps minimize the potential downtime of DB2 related application systems.
最小化加权总完工时间的单机排序问题。
Minimize the total weighted completion time single machine scheduling problems.
在层次图边交叉最小化问题上，常规启发算法或者时间复杂度大或者布图效果不佳。
On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory.
为了解决最小化旅行时间的多旅行商一类问题，提出了一种递阶遗传算法和矩阵解码方法。
To solve a kind of multiple traveling salesman problem(MTSP)for minimizing the completion time, a hierarchical genetic algorithm(HGA)and decoding method with matrix are proposed.
针对作业车间调度问题，提出了最小化空闲时间的处理过程及其变异算子，设计了一种自适应遗传算法。
Classic scheduling benchmark problem test shows:the self-adaptive measure can efficiently keep current populations diversity, can use very small population size; shortest idle time .
选拔算法是两级逻辑综合中求解最小化覆盖的经典方法之一，但在输出变量集合和质立方体集合规模较大的情况下，采用选拔法求最小化覆盖存在空间复杂度高、求解时间长等问题。
But as the output variables and the prime implicant grow up, both the long processing time and the resource requirement become the major problems to be resolved with the extraction method.
其次研究了非连续频谱感知策略的优化设计问题，即在满足感知开销限制的条件下，如何最小化空闲频谱发现时间。
Secondly, the optimal design of discontinuous spectrum sensing scheme was studied, which aimed at minimizing the spectrum opportunities discovery time while satisfying the sensing overhead constraint.
研究三个并行处理器环境中，具有递减链约束的多处理器任务的调度问题，调度目标是最小化总处理时间，假设单项任务需单位处理时间。
This paper focuses on scheduling unit length multiprocessor tasks with de-creasing chain precedence constrains on three identical processors so as to minimize makespan.
如何将应用程序中的任务分配到处理机上，使并行程序的执行时间最小化就成了一个重要的问题。
Parallel algorithms must be solved on distributed systems. The tasks assignment algorithms is important on parallel computing system.
如何将应用程序中的任务分配到处理机上，使并行程序的执行时间最小化就成了一个重要的问题。
Parallel algorithms must be solved on distributed systems. The tasks assignment algorithms is important on parallel computing system.
应用推荐