助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   时延受限 在 自动化技术 分类中 的翻译结果: 查询用时:2.278秒
图标索引 在分类学科中查询
所有学科
自动化技术
互联网技术
电信技术
航空航天科学与工程
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

时延受限    
相关语句
  delay-constrained
    Now, researches on multicast routing algorithm mainly focus on multicasting algorithm without constraints and delay-constrained multicast routing, and also use heuristic algorithm.
    目前组播路由算法的研究大多都针对无约束组播路由问题和时延受限组播路由问题,多采用启发式等方法。
短句来源
    At present, most of the multicast routing algorithm researches prone to adopt heuristic algorithm to solve unconstrained and delay-constrained multicast routing problems.
    目前QoS组播路由算法的研究大多都针对无约束组播路由问题和时延受限组播路由问题,多采用启发式等方法。
短句来源
  delay-constrained
    Now, researches on multicast routing algorithm mainly focus on multicasting algorithm without constraints and delay-constrained multicast routing, and also use heuristic algorithm.
    目前组播路由算法的研究大多都针对无约束组播路由问题和时延受限组播路由问题,多采用启发式等方法。
短句来源
    At present, most of the multicast routing algorithm researches prone to adopt heuristic algorithm to solve unconstrained and delay-constrained multicast routing problems.
    目前QoS组播路由算法的研究大多都针对无约束组播路由问题和时延受限组播路由问题,多采用启发式等方法。
短句来源
查询“时延受限”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  delay-constrained
This paper proposes an effective heuristic algorithm for dynamic multicast routing with delay-constrained DDMR.
      
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained
      
The protocol finds a least-cost, delay-constrained path for real-time data in terms of link cost that captures nodes' energy reserve, transmission energy, error rate and other communication parameters.
      
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
      
In this paper, we propose a new dynamic delay-constrained least-cost multicast routing algorithm (DDCLCMR) to support these applications.
      
更多          
  delay constrained
An algorithm based on mobile agent for delay constrained least cost unicast routing
      
The delay constrained least cost path problem with imprecise delay information is discussed, and a distributed heuristic algorithm without any assumption of imprecise state information is presented.
      
In this paper, we add a delay variation constraint to the problem of delay constrained shortest path.
      
In this section, we simulate to study the effect of contention resolution scheme for delay constrained traffic.
      
In our simulation, we consider 20% of the total traffic as delay constrained traffic.
      
更多          
  delay-constrained
This paper proposes an effective heuristic algorithm for dynamic multicast routing with delay-constrained DDMR.
      
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained
      
The protocol finds a least-cost, delay-constrained path for real-time data in terms of link cost that captures nodes' energy reserve, transmission energy, error rate and other communication parameters.
      
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
      
In this paper, we propose a new dynamic delay-constrained least-cost multicast routing algorithm (DDCLCMR) to support these applications.
      
更多          
  delay constrained
An algorithm based on mobile agent for delay constrained least cost unicast routing
      
The delay constrained least cost path problem with imprecise delay information is discussed, and a distributed heuristic algorithm without any assumption of imprecise state information is presented.
      
In this paper, we add a delay variation constraint to the problem of delay constrained shortest path.
      
In this section, we simulate to study the effect of contention resolution scheme for delay constrained traffic.
      
In our simulation, we consider 20% of the total traffic as delay constrained traffic.
      
更多          
  其他


The problem of computing delay-constrained minimum-cost multicast trees is of great interest in the last few years. So far, the Bounded Shortest Multicast Algorithm (BSMA) has been thought to be the best constrained multicast algorithm. However, the large computation time restricts its application. As a global optimizing algorithm, Genetic algorithm (GA) is applied to solve the problem of multicast more and more. GA has more powerful searching ability than traditional algorithm, however, the property of prematurity?makes...

The problem of computing delay-constrained minimum-cost multicast trees is of great interest in the last few years. So far, the Bounded Shortest Multicast Algorithm (BSMA) has been thought to be the best constrained multicast algorithm. However, the large computation time restricts its application. As a global optimizing algorithm, Genetic algorithm (GA) is applied to solve the problem of multicast more and more. GA has more powerful searching ability than traditional algorithm, however, the property of prematurity?makes it difficult to get a good multicast tree. A Clonal Strategies (CS) based multicast algorithm is presented in this paper, which saliently solves the prematurity?problem in Genetic based multicast algorithm. Furthermore, the algorithm is accelerated by using an adjustable parameter to reduce the search space. The algorithm has the property of simple realization and flexible control. The simulated results show that CS has better performance than BSMA and GA.

近年来,时延受限的代价最小多播树问题备受关注.到目前为止,BSMA(bounded shortest multicast algorithm)算法被认为是最好的受限多播路由算法;然而,过长的计算时间限制了其应用.作为一种全局优化算法,遗传算法(genetic algorithm,简称GA)被越来越多地应用于多播路由问题.与传统的算法相比,遗传算法的全局搜索能力更强,但其易早熟的特点使它并不总是能得到最优多播树.提出的基于克隆策略的多播路由算法,有效地解决了遗传多播路由算法中的早熟问题,并通过引入一个可调因子缩小了搜索空间,加快了算法的收敛速度.算法实现简单、控制灵活.仿真结果表明,该算法的性能优于BSMA算法和传统的遗传算法.

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关时延受限的内容
在知识搜索中查有关时延受限的内容
在数字搜索中查有关时延受限的内容
在概念知识元中查有关时延受限的内容
在学术趋势中查有关时延受限的内容
 
 

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