最小代价的英文

• minimum cost

• "最小"英文翻译    minimum
• "代价"英文翻译    price; cost
• "最小代价流" 英文翻译 :    minimum cost flow
• "最小代价路径" 英文翻译 :    minimal cost path
• "最小代价网络" 英文翻译 :    minimum cost network
• "最小代价, 最低成本" 英文翻译 :    minimum cost
• "最小代价程序设计" 英文翻译 :    minimum cost programming
• "最小代价函数估计" 英文翻译 :    minimum cost estimate; minimum-cost estimate; minimum-costestimate
• "最小代价生成树" 英文翻译 :    minimum cost spanning tree
• "最小代价的死锁状态恢复" 英文翻译 :    minimum cost deadlock recovery
• "最小代数群" 英文翻译 :    smallest algebraic group
• "小代" 英文翻译 :    koshiro; kotai; ojiro; shodai
• "代价" 英文翻译 :    price; cost 不惜任何代价 prepared to pay any price; at any cost; at all costs; 付出很高代价 pay a high price (for); 代价券 scrip
• "缩小代沟" 英文翻译 :    narrow the gap
• "小代瓦斯" 英文翻译 :    dewas junior branch
• "小代奥米德岛" 英文翻译 :    little diomede island
• "最小" 英文翻译 :    minimum◇最小半径 least radius; 最小公倍数 lowest common multiple (lcm); least common multiple
• "代价；约价" 英文翻译 :    consideration
• "代价牌" 英文翻译 :    token
• "代价券" 英文翻译 :    token
• "价格；代价" 英文翻译 :    price
• "替代价" 英文翻译 :    substitute valence
• "以…代价" 英文翻译 :    at the cost of
• "爱的代价" 英文翻译 :    cost of the love; the cost of love; the price of love; what you do about me
• "爱情的代价" 英文翻译 :    the price of love

• The source tree built by the least cost
  基于最小代价建立有源树
• A multicast routing algorithm based on multiple qos constraints via multiple paths
  一种多受限最小代价的动态组播路由算法
• Minimum spanning tree
  最小代价生成树
• An optimization model and a criterion with minimum cost which fulfilling the system ? availability constraint are presented for redundant multi - sensor system
  本文提出了一种多传感器冗余系统的优化模型和满足有效度约束的最小代价准则。
• Our goal is to construct a general dw engine in which the existing mis system and distributed database system can embed , and to improve it as a dw system which can be used to develop high level data application at the lowest cost
  我们的目标是致力于构建一个通用的可嵌入现有mis系统和分布式数据库系统的数据仓库引擎，以最小代价将它们提升为数据仓库系统，进而进行高层的数据应用开发。
• E3d r - tree takes into account the features of moving object data and takes advantage of new cost parameters . in particular , least - cost - first search algorithm is used in the insertion algorithm to find the overall best way to insert a new record in e3d r - tree . the proof of the vidility of the algorithm is given
  在e3dr - tree中,结合移动对象数据特征引入空白区域作为新的插入代价参数,同时,在插入算法中利用最小代价优先搜索算法确定全局最优插入路径,并给出算法正确性证明。
• In this thesis , firstly , the existing heuristic algorithms for steiner tree problem are summarized ; secondly , a research and analysis is made on the multicast trees that satisfy qos requirement and a fast routing algorithm for delay - constrained low - cost multicast is presented . through simulation , we find that the proposed algorithm is simple and can get the low - cost tee in polynomial time . at last , the multicast routing and wavelength assignment in wdm optical networks is studied ; a routing and wavelength assignment in wdm all - optical networks is presented
  本论文首先综述了多播路由问题的理论基础，接着对满足qos约束的多播路由问题进行了研究，提出了一种快速的时延受限最小代价多播路由算法，该算法简单、快捷，能在多项式时间内找到满足时延约束的代价较小的多播树，具有良好的性能；最后，研究了wdm光传送网中的多播路由和波长分配问题，并提出了wdm全光网络中的多播路由与波长分配算法，该算法将路由和波长分配统一进行，构造了时延受限低代价多播树，克服了将寻径和波长分配分步进行的弊端，避免了同类算法的较高复杂性。
• Two interactive segmentation methods , snake ( active contour ) and live wire , which are very popular , have been introduced for the medical image segmentation . a snake is a spline curve , which is controlled by an energy equation . to minimize the snake ' s total energy , the finite difference and greedy algorithm have been implemented
  论文引入了snake和livewire两种十分流行的医学图像交互分割方法，详细推导snake的能量方程，实现了最小化能量方程的有限差分和greedy两种算法，并利用邻近图像的相似性，将其成功应用于图像序列的分割； livewire是一种象素级的轮廓搜索算法，它在方向图中找到开始点和目标点之间的最小代价路径。
• By computing the cost of the cheapest subtree with size constraints of the partial tree ( this is an upper bound on the cost of the final optimal tree ) and lower bounds on the cost of subtrees of varying sizes that are rooted at nodes of the partial tree , the algorithms can identify and prune nodes that cannot possibly belong to the optimal constrainted subtree
  建树阶段设置大小限制的修剪算法是通过计算出不完整树的最小代价得到优化树的代价上限，根据此上限以及计算出的节点的实际代价来修剪节点的。在预测模型中应用了在建树阶段加入大小限制条件的修剪算法。
• Classification and regression trees processing part introduces growing algorithm of cart , pruning algorithm of cart and selecting best tree algorithm etc . on the basis of the concerned new model , the thesis presents in details the designing of multi - rules neural network based cart system for abnormal customers recognition
  在分类回归树部分，介绍了分类回归树的生长算法、最小代价?复杂性剪枝算法以及最优树选择等算法。提出了系统设计之后，论文详细介绍了该系统的开发，用以解决异动客户的识别问题。