助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   多项式算法 的翻译结果: 查询用时:0.057秒
图标索引 在分类学科中查询
所有学科
数学
计算机软件及计算机应用
铁路运输
宏观经济管理与可持续发展
自动化技术
非线性科学与系统科学
交通运输经济
企业经济
电信技术
更多类别查询

图标索引 历史查询
 

多项式算法     
相关语句
  polynomial algorithm
     The polynomial algorithm for the supply chain scheduling problem A_s‖sum from i=1 to s sum from j=1 to n (W_(ij)C_(ij))
     供应链排序问题A_s‖sum from i=1 to s sum from j=1 to n (W_(ij)C_(ij))的一个多项式算法(英文)
     Finally, a strongly polynomial algorithm with complexity of O(V 3) is presented.
     最后 ,给出了一个复杂度为 O( V 3)的多项式算法 .
短句来源
     A POLYNOMIAL ALGORITHM FOR FINDING A SPANNING TREE WITH MAXIMUM DEGREE CONSTRAINT IN K 1,r free graphs
     K_(1,r)-free图的次限制树多项式算法
短句来源
     A strong polynomial algorithm is proposed to solve the problem.
     讨论了此类问题的特性 ,并给出了解决问题的一个强多项式算法 .
短句来源
     The Beneficial Directions Model and a Polynomial Algorithm for the Train Formation Plan on Straight Line
     直线方向列车编组计划有利去向模型及其多项式算法
短句来源
更多       
  polynomial time algorithm
     The author study the minimum cost flow problem with not only fixed cost but also variable cost,and they found it be a mixed 0-1 linear program,and it does not have polynomial time algorithm.
     研究了带容量限制的带固定费用和可变费用的最小费用流问题,发现该问题是混合0-1整数规划问题,不存在多项式算法.
短句来源
     This is a polynomial time algorithm. The complexity is O(n~3) where n is the dimension of the problem.
     这是一种多项式算法,计算的复杂性是O(n~3),n是问题的维数。
短句来源
     Khanchian's ellipsoidal algorithm and Karmarkar's projective rescaling algorithm for linear programming were proved of polynomial time algorithm.
     Khanchian的椭球法和Karmarkar的投影尺度法,证明了线性规划问题确实存在多项式算法
短句来源
     Kececioglu and Ravi firstly gave a 2-approximation polynomial time algorithm for translocation. They also gave a 3/2-approximation polynomial time algorithm for computation of rearrangement distance for both reversal and translocation.
     对于该问题,Kececioglu与Ravi首先给出近似性能比为2的多项式时间近似算法,并进一步给出近似性能比为3/2的移位与反转同时存在的计算重组距离的近似算法,最终在1996年由Hannenhalli给出复杂度为O(n~3)的移位排序的多项式算法
短句来源
     A polynomial time algorithm is developed for the restricted version in which the jobs in each group have the same due date.
     对同组工件有相同工期的限制情形给出了一个多项式算法
短句来源
更多       
  polynomial-time algorithm
     Karmarkar Atgoritahm—A New Polynomial-Time Algorithm for Linear Programming
     Karmarkar算法——一种新的线性规划多项式算法
短句来源
     New Polynomial-Time Algorithm for Linear Programming—Saddle Surface Algorithm
     一种新的线性规划多项式算法—鞍面算法
短句来源
     A Polynomial-Time Algorithm for Liner Fractional Programming
     线性分式规划的多项式算法
短句来源
     An Improvement on Karmarkar Algorithm for Linear ProgrammingUsing a Polynomial-Time Algorithm for LinearFractional Programming
     用线性分式规划的多项式算法改进线性规划的Karmarkar方法
短句来源
     A new polynomial-time algorithm for linear programming—Karmarkar algorithm is presented, and its generation is analysed in detail.
     本文介绍一种新的线性规划多项式算法——Karmarkar算法,并演示了它的产生过程。
短句来源
更多       
  polynomial algorithms
     For the NP-hard problem F 2 | pi j = Xij+αijSij| C max, by defi- ning dominating relations among procssors, the polynomial algorithms are given under the dominating procssors respectively for the general linear deteriorating the flow shop sched- uling problem Fm | pij = Xij+αijSij|Cmax.
     对NP难问题F 2| pi j= X ij+αijSij| C max,通过定义处理机间的优势关系,得到处理机在满足优势关系下,线形恶化最小化完工时间的流水作业排序问题Fm | pi j= X ij+αij S ij|Cmax的多项式算法.
短句来源
     Furthermore, we analyze two special cases for m = 2, and polynomial algorithms are given.
     此外,分析了m=2的两种特殊情况,给出了多项式算法.
短句来源
     Two Polynomial Algorithms on a Special Integer Bottleneck Problem
     整数瓶颈问题的两个多项式算法
短句来源
     It has been an important direction of Petri net applications to find practical and efficient polynomial algorithms.
     寻找实际可行的多项式算法一直是Petri网应用的重要方面.
短句来源
     On the other hand, we give necessary and sufficient conditions for the existence of ( f -; f +)-factors or (g-, f -; g+, f +)- factors in digraphs according to the theory of network flows. Polynomial algorithms are provided to find an ( f -; f +)-factor or a (g-, f -; g+, f +)-factor in a digraph.
     另一方面,本文运用网络流知识讨论了有向图含有(g~-, f~-; g~+, f~+)因子、( f~-; f~+)因子的充要条件,并且给出了求有向图中的(g~-, f~-; g~+, f~+)因子、( f~-; f~+)因子的多项式算法.
短句来源
更多       

 

查询“多项式算法”译词为其他词的双语例句

 

查询“多项式算法”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  polynomial algorithm
In this note, the author proves that the inverse problem of submodular function on digraphs with l∞ objective function can be solved by strongly polynomial algorithm.
      
Simple necessary conditions for existence of the desired tree, heuristic rules for displacement of the terminals for which these conditions are not satisfied, and a new polynomial algorithm to determine an approximate solution were presented.
      
A polynomial algorithm for solving the problem in a rectangular metric is designed.
      
A polynomial algorithm for processing analytical signals from a sensor array was tested in the analysis of ternary mixtures.
      
This characterization implies characterizations of some well-known subclasses of the class of well-covered graphs as well as the existence of a polynomial algorithm for the recognition of well-covered graphs with bounded valences.
      
更多          
  polynomial time algorithm
This problem has been shown to be NP-complete and can't be solved with polynomial time algorithm.
      
No polynomial time algorithm is known to produce the optimal or even a constant approximation of the optimal solution, and it is also unknown whether the problem is NP-hard.
      
We propose a polynomial time algorithm to solve the problem.
      
It is proved that the problem is NP-complete by describing a nondeterministic polynomial time algorithm for it.
      
In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.
      
更多          
  polynomial-time algorithm
In the case where a graph is not w-balanced, a polynomial-time algorithm to find a subgraph of maximum w-density is proposed.
      
We generalize properties of Goppa codes to this family, including bounds on the dimension and minimum distance and construction of a polynomial-time algorithm of decoding up to the designed distance.
      
Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets
      
We introduce a polynomial-time algorithm to solve the problem when the processing times of all batches are identical and the setup and cleaning times are sequence-independent.
      
The results suggest that it is very unlikely to develop polynomial- or pseudo-polynomial-time algorithm for finding exact solutions for the two problems.
      
更多          
  polynomial algorithms
As admissible solutions (algorithms), it is common practice to study polynomial algorithms, which owe their name to the form of the dependence of time expenditure on the length of the original information.
      
Investigation of polynomial algorithms for solving the three-index planar assignment problem
      
Polynomial algorithms for the solution of this problem are proposed.
      
Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
      
Polynomial algorithms for solving the vector sum problem
      
更多          
  其他


点击这里查询相关文摘
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关多项式算法的内容
在知识搜索中查有关多项式算法的内容
在数字搜索中查有关多项式算法的内容
在概念知识元中查有关多项式算法的内容
在学术趋势中查有关多项式算法的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社