在这篇论文中，我们提出了一个链路选择函数用于解决时延约束组播问题。
In this paper, we present an edge selection function for solving the delay bounded multicast problem.
工业测试实例实验表明，该算法能够有效地优化电路时延，满足时延约束。
Experimental results show that the algorithm can optimize the timing of circuit efficiently and the timing constraint is satisfied.
针对时延约束的最小代价组播路由问题，提出四种时延约束组播源路由算法。
Propose four delay-constrained multicast source routing algorithms to solve delay-constrained least-cost multicast routing problem.
文章介绍了一个可以同时考虑时延约束和拥塞度优化的VLSI总体布线新方法。
Introduced in this paper is a new approach for VLSI interconnect global routing that can optimize both congestion and delay, due to routing topology flexibilities.
摘要：算法利用网络中每个节点的状态信息，通过选择探测的方法搜索满足业务带宽和时延约束要求的路由。
Absrtact: This algorithm depends on the local state of each node in the networks, searches routes that meet bandwidth and delay requirements through the selective probe method.
针对具有时延约束最小代价路径问题，提出一种基于禁忌搜索方法的时延约束的最小代价单播路由算法（TSBDRA）。
A novel algorithm based on Tabu Search for Delay-Constrained Least-Cost Routing (TSBDRA) is proposed to solve delay-constrained least-cost unicast routing problem.
为了减少入口节点处的数据突发时延，提出了一种基于业务流带宽约束的前向资源预留（FRR-BC）策略。
A forward resource reservation scheme based on traffic bandwidth constraints (FRR-BC) is proposed in order to reduce the latency of data bursts at the ingress node.
针对纯时延和有约束的情况，应用目标规划作为优化策略，提出了一种增量型模型算法控制策略。
For the situation with dead time and constraints, a control strategy of increment model algorithm was developed using goal programming as optimal strategy.
提出了一种在非精确网络状态信息下满足时延和带宽约束的最小代价组播路由算法。
A delay and bandwidth constrained least-cost multicast routing algorithm with imprecise state information is proposed.
该算法直接利用前一周期的时延信息来更新路由表，以作为当前寻找路径的依据，在满足带宽和时延波动约束条件下，使数据传送过程时延最小化。
It can refresh the router table by the previous delay information to find a suitable path with the constraints of the bandwidth and the delay-jitter.
研究并实现了约束提取及约束下的非强健通路时延测试产生算法。
A constraint extraction method and a constraint path delay test generation algorithm are developed.
为求解通信时延受约束的低能耗片上网络(NoC)映射问题，提出一种改进禁忌搜索算法。
An improved tabu search algorithm is proposed to solve the low energy network-on-chip (NoC) mapping problem subject to communication latency constraints.
为求解通信时延受约束的低能耗片上网络(NoC)映射问题，提出一种改进禁忌搜索算法。
An improved tabu search algorithm is proposed to solve the low energy network-on-chip (NoC) mapping problem subject to communication latency constraints.
应用推荐