助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   最小生成 的翻译结果: 查询用时:0.023秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

最小生成
相关语句
  minimum span
     Dynamic optimum of minimum span tree's algorithm devised by Prim
     Prim最小生成树算法的动态优化
短句来源
     Reference [1] and [2] suggest an approach of minimum span tree for automatic pick of the stacking velocity.
     在文献[1][2]中,曾先后提出过利用图的最小生成树的模型和方法自动拾取叠加速度,并取得了一定的效果。
短句来源
     Minimum span tree based dynamic multicast routing algorithm
     基于最小生成树的动态多播路由算法
短句来源
     According to the minimum span tree's algorithm devised by prim,designs a unique closedge vector whose type is CloseEdge,the closedge vector is used to represent edges between any pairs of point in U set and V-U set,sets up an adjacency multiple doubly linked list to show a undirected graph with top triangle matrix,builds doubly linked list representing VU set to link to closedge vector and to adjacency multiple doubly linked list.
     根据Prim最小生成树算法的设计思想,设计了独特CloseEdge型closedge向量表示U到V-U集合中的边,用上三角法建立了无向图的邻接多重双向链表,构造了链接closedge向量和邻接多重双向链表表结点的VU集合双向链。
短句来源
     Find the edge with minimum weight only in doubly linked VU list,and after adding a vertex into U set,in constant time to delete one corresponding node in doubly linked VU list and another corresponding vertex in adjacency multiple doubly linked list,thus to produce a minimum span tree in minimum time,the average frequent of sentence execution is e,that is the number of edge in graph.
     查找最小权值的边仅在VU集合双向链上进行,且当顶点被加入U集合后,常量时间删除其对应的VU集合双向链和邻接多重双向链表中的结点,使得最小生成树的生成达到极小化,其语句执行频度平均为e。
短句来源
更多       
  minimum generated
     n this peper we give a operation as multiPOlication to finite digraph D,obtain a finite nilPOtentsemigroup S, and show that,the minimum generated set of S is A=S-S2,is venices set of D.
     本文给有限有向图D定义了乘法,从而得到这个有向图确定的半群S,证明了S的最小生成集A=S-S2=V(D的顶点集)且,这个半群的秩等于D的顶点的个数。
短句来源
  “最小生成”译为未确定词的双语例句
     In this paper,weobtained that F has a generated subset{f_0,f_1}. Moreover,for the case n=3,we have proved that F has a smallest genera- ted subset{k(x,y)}.
     证明了 F 有生成集{f_0,f_1},并且当 n=3时,证明了 F 有最小生成集{k(x,y)}。
短句来源
     Based on separable rectilinear minimum spanning tree (SMST), optimal algorithms for rectilinear Steiner tree L_RST and optimal Z_RST are presented.
     本文提出了基于可分离最小生成树(SMST)的优化L形直角斯坦(Steiner)树(L_RST)和优化Z_RST的算法。
短句来源
     Finding the minimum spanning trees of undirected complete graph based on global optimization
     基于Global optimization寻找无向完全图的最小生成
短句来源
     Formal Derivation of the Minimum Spanning Tree Algorithm with PAR Method
     最小生成树算法的PAR方法形式化推导
短句来源
     Given an undirected connected weighted graph G = (V,E), where |V| = n, | E | = m, the MST T of G might be changed when the cost of some edge of G changes.
     给定连通无向赋值图G=(V,E),|V|=n,|E|=m,当G的某边的赋值改变时,必引起其最小生成树的改变。
短句来源
更多       
查询“最小生成”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  minimum span
We look for a walk of minimum span, where the span of a walk is defined as the cost of a maximum cost subwalk (subsequence).
      
This paper also presents two single equations to estimate the minimum angle between the humerus and the body as well as the minimum span ratio of a bird in gliding flight.
      
It is well known that, when adopting a binary constraints model, clique and near-clique subproblems have a dominant role in the theory of lower bounds for minimum span problems.
      
A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation
      
The genetic algorithm (GA) described in this paper breeds permutations of transmitters for minimum span frequency assignment.
      
更多          
  minimum generated
The pressure minimum generated by the inner vortex structure is well visible in the y z-plane together with the vortex motion surrounding it.
      


This paper extends the heuristic algorithm for network design from one dimensional space into two dimensional space, taking minimal spanning tree as initial network, thus suggesting a heuristic algorithm which can be used efficiently for centralized network design on time delay constraint.

本文把网络设计的试探算法从一维空间扩展到二维空间,用最小生成树作为起始网,提出了一种便于以时延为约束条件的网络设计试探算法。

K·H·Kim and F·W·Roush have established the concept of the a fuzzy matrix[1]. In this paper,the concept of the minimal generating set of fuzzy vector class is given in Vn. It is possible to find the Schein rank of given fuzzy matrix or the largr inferior bound of the Schein rank by the method of computing the minimal generating set.

文建立了模糊矩阵Schein秩的概念,文中对半环[0,1]上的模糊矩阵特殊情形的Schein秩的求法做了一些讨论.但是,借助中方法,对许多形式的模糊矩阵只能求得Schein秩的一个较小的上界.本文提出了V_n中模糊向量组的最小生成集的概念,借助最小生成集的计算,可以求出半环[0,1]上模糊矩阵的Schein秩或其一个较大的下界.

To pick the stacking velocity by computerization can provide useful information for interval velocity etc. It is of great immediate significance in realizing automatic seismic data processing and their integrated geological interpretation. Reference [1] and [2] suggest an approach of minimum span tree for automatic pick of the stacking velocity. Some positive results are obtained. A new method for automatic pick of stacking velocity, an optimum search algorithm with minimized pick risk is proposed.

用计算机自动拾取叠加速度,并进而得到层速度等信息,对实现地震资料处理自动化和计算机进行综合地质解释有着十分重要的意义。在文献[1][2]中,曾先后提出过利用图的最小生成树的模型和方法自动拾取叠加速度,并取得了一定的效果。本文研究了一种新的自动提取叠加速度的方法:极小化拾取风险的最佳搜索算法。 通过对实际资料进行试验,结果表明方法是有效的,现已作为一个模块引入PDP-11/45的prospector系统中,并在生产中试用。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关最小生成的内容
在知识搜索中查有关最小生成的内容
在数字搜索中查有关最小生成的内容
在概念知识元中查有关最小生成的内容
在学术趋势中查有关最小生成的内容
 
 

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