In this paper,we discuss the algorithm of maximum concurrent flow problem given by Karakostas G,modify the parameter of it,apply it and present fully polynomial approximation schemes for generalized maximum concurrent flow problem that run in time independent of the number of commodities k.
研究了Karakostas G给出的求解最大并行流问题的一个近似算法,将其算法的参数进行了改进,给出了算法的时间复杂性不依赖于物资数k的广义最大并行流的全多项式时间近似算法,该算法只适用于广义的lossy网络。
We present the fully polynomial approximation schemes for max concurrent flow problem for λ≥1/(1+3ε) OPT,through modifying of the algorithm with objective function value of λ≥(1-ε)~3 OPT by Fleischer.
L给出的求解最大并行流问题的一个近似算法,其求出的目标函数值为λ≥(1-ε)3OPT。
A CONFLUENT ACTIVE RULE EXECUTION MODEL WITH MAXIMAL PARALLELISM
具有最大并行度的合流性主动规则执行模型
prosecuted to the fullest extent of the law.
最大限度地执行法律.
// criminal and civil penalties, and will be prosecuted to the maximum //
//遭受严厉的刑事和民事制裁，并将对此行为进行法律许可范围内最大程度的起诉//
The legal system that regulates the transaction and maximizes the benefit of the trade is the only obstacle for realizing, evolving and perfecting the trade.
而约束这些交易行为并使交易的收益最大化的法律制度是实际、进行和完善交易的唯一保障。
Parallel BFGS Algorithm for a Class of Large Scale Optimization Problem;
一类大规模最优化问题的并行BFGS算法
Parallel Maximum Likelihood Decoding Algorithm for RM Codes
RM码的一种并行最大似然译码算法
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).
考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。
It analyses precision of the model and presents some cases.
并对此模型的精度进行了分析，最后给出了实例。
apparent maximum altitude
视最大高度最大视高度
Method Improvement of the Parallel Computing for the Large-scale Basin Hydrology
大尺度流域水文并行计算的方法改进
The great virtue of air travel is speed.
乘飞机旅行的最大优点是速度快。
The largest maximum length for a single line of text is 255 characters.
单行文本的最大长度是 255 个字符。
Some of the sails were again hoisted, and the speed of the boat was very good.
船主命令重新装起大帆，并将帆面缩到最小限度。
Parallel processing is the most important peculiarity in this design.
其中,并行化的设计理念是该设计的最大特点。
Algorithm for finding frequent itemsets based on VOPP
基于VOPP并行编程环境的最大频繁项集生成方法
Parallel Min-Max Modular Support Vector Machine with Application to Patent Classification
并行化最小最大模块化支持向量机及其在专利分类中的应用
How can we take that crush strength and back-calculate the maximum height to which the reactor can be loaded?
我们如何得到抗碎强度并反算出反应器所能装载的最大高度呢？
The Highest Theory of Stockholders Interest:Evidence from The Biggest Acquisition of global banking;
股东利益至上的全球银行业最大并购案——荷兰银行被收购案分析