max-flow
英 [mæks fləʊ]
美 [mæks floʊ]
网络 最大流; 最大流量; 最大的
双语例句
- The famous max-flow min-cut theorem determines the maximum throughput of a network.
最大流最小割定理决定了网络的最大吞吐量。 - An Algorithm for the Minimum Cost Max-flow with Limited Flow Between Two Notes in the Traffic and Transportation Network
交通运输网络中两个结点间有流量约束的最小费用最大流算法 - Constructing a simple network and converting the allocation problem into the min-cost max-flow in the network, we have developed an optimal algorithm for the allocation problem.
我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。 - It can meet users 'needs with different grade as well as possible at the prerequisite of guaranteeing the tubes' constraint, such as the max-flow, etc.
可以在保证各管段最大流量等约束条件的前提下，尽可能地满足不同优先级别用户的需求； - First, uses the network max-flow algorithm in preprocessing to divide the teaching tasks into several groups, in which the tasks can be carried on simultaneously without collisions and the number of the required classrooms not lager than the number of the supplied ones.
首先，使用网络最大流算法预处理，把授课任务分成若干组，同组的任务可以同时进行而不发生冲突，而且保证教室需求量不大于供应量。 - Research on Network Max-flow Pareto Expansion Problem
网络最大流Pareto扩充研究 - And then the two-commodity max-flow theorem is proved according to the idea mentioned above.
本文由此还证明了二商品流最大流定理。 - Practical design and dynamic implementation of efficient algorithms for max-flow problem
最大流有效算法的实用化设计与动态实现 - A Synthesizing Flow Algorithm of Two-commodity Max-flow Problem
二商品流最大流问题的合成流算法 - Network coding is a new method by which a multicast network can achieve the network capacity determined by the max-flow and min-cut theorem.
网络编码是一种全新的概念，组播网络中应用网络编码可以得到由最小割最大流理论确定的网络容量。 - Determination of mine ventilation network max-flow based on independent paths
用独立通路法确定矿井通风网络的极值流 - Also developed are the algorithm to find all pareto optimal solutions about time and cost with given expanded network max-flow.
研究了给定网络容量扩充目标要求下，求解所有关于时间和费用的Pareto优化解问题并提供了相应算法。 - If coding is permited by the network vertices the max-flow bound of network multicast can be achieved, i.e. the theoretical upper bound of network resource utilization, which can not always be achieved by traditional copying and routing.
通过允许网络节点进行编码，可以获得网络组播速率的最大流限，即网络资源利用的理论上限，而通过传统的路由和复制并不一定能够获得该最大流限。 - Study shows network coding can increase the network throughput, and achieve the upper bound which is determined by the Max-flow Min-cut theorem.
通过网络编码，可以充分的利用网络的信道通信容量，达到由最小割最大流定理所确定的最大流上界。 - Network coding, first proposed to achieve the max-flow bound of network multicast in the wire line networks, is an information exchange technology which combines coding and routing.
网络编码融合了编码和路由技术，有效解决了有线多播网络的最大流传输问题。 - Network max-flow determines the network capacity. It is of practical significance to research network max-flow.
网络最大流决定了网络的容量，所以研究网络最大流具有较大实际意义。 - In this method, the nodes on the testing path are set in an array and the Max-flow algorithm is used to find the testing path.
该方法利用数组来表示测试路径节点，结合最大流算法来寻找测试路径。 - Other than traditional multicast routing algorithms, the network information flow can approach the max-flow of multicast network by adopting network coding. So, coding is better than routing.
不同于传统路由方法，在多播通信网络中，通过网络编码可使信息传输速率达到网络的最大流量，从而编码的方式优于路由的方式。 - Finally, on the butterfly network, to compute the max-flow for each sink node and by analyzing all max-flow paths, discover a node-overlap.
最后，对于蝴蝶网络，为每一个汇节点计算了最大流，通过对每一条最大流路径进行分析，可以发现一个节点覆盖现象。 - The proposed algorithm combines the color and motion information of the pixels to establish the energy function and construct the graph. Then the algorithm minimizes the energy function using the max-flow/ min-cut method and therefore achieves multiple objects tracking.
该算法结合像素的颜色信息和运动信息建立能量方程，构建网络图，利用最大流/最小割理论实现能量方程最小化，从而完成对多目标的跟踪。 - Firstly, the algorithm converts the input sequences to graph, and then finds out the maximum density subgraph of graph with max-flow algorithm, for short MDS, and shows the motif with MDS with a polynomial time solution.
首先本文算法将输入序列转换成图，然后使用最大流算法搜索图的最大密度子图，简称MDS，并用最大密度子图表示识别出的模体，其时间复杂度是多项式的。 - By applying Min-cut/ Max-flow of graph theory to the image dodging algorithm, water area and terrestrial area can be processes separately, which effectively avoids the water specular reflection effect.
把图割理论中的最大流最小割思想引入到图像匀光算法中，将水域与陆地区域进行区分处理，有效地避免了因水域的镜面反射作用对整幅图像匀光效果的影响。 - We solved the data scheduling optimization problem by computing the max-flow of the mapped virtual flow network.
MFDS将P2P流媒体视频点播系统中的数据传输映射到虚拟的流网络，通过虚拟流网络的最大流求解来解决数据调度的优化问题。