RWA greatly affects the performance and TE (Traffic Engineering) of ASON.
RWA对ASON的性能和流量工程(TE)影响很大。
This method would be useful for solving the problem of optical network RWA which has wavelength conversion capabilities.
该模型用于解决具有波长转换能力的RWA问题效果明显。
Compared with traditional WDM Network, RWA under ion circumstance has to meet new requirements and has to face new challenges.
相对于传统WD M光网络，基于智能光网络环境下的RWA问题必须面对新的需求和挑战。
To compare the results of simulated anneal algorithm on the static RWA problem, a heuristic algorithm is introduced as reference.
为了衡量模拟退火算法解决静态rwa问题的结果，采用了一种启发性算法作为参考。
A novel dynamic router and wavelength assignment (RWA) algorithm for the dynamic wavelength router optical network (WRON) was presented here.
针对波长路由网络中动态光链路建立问题，提出了一种快速动态波长路由算法(RWA)。
Among the 25 Banks with the lowest ratios of RWA to total assets, most have innocuous explanations and will be largely unaffected by Basel III.
在最低风险权重资产占总资产比率最低的25家银行中，大部分有无伤大雅的解释，将未受巴塞尔协议III的影响。
This paper discussed the basic question of RWA and analyzed the gain saturation of EDFA, finding the defects of FAR algorithm and made improve on it.
通过对RWA基本问题的探讨，对EDFA出现的增益饱和现象的分析，找到了FAR算法中所存在的弊端并进行了改进。
The WDM optical networks employing routing and wavelength assignment (RWA) are considered as the most competitive candidates for next generation backbone networks.
采用路由选择和波长分配（RWA）的WDM光网络被认为是下一代高速广域骨干网的最有竞争力的候选方案。
In a high-intensity optics field, using rotating waves approximation (RWA) and the special transform, the problem of two-level atoms transition attributes to the Hill equation.
在强光信号作用下，经过一定的数学代换后，上能级几率的求解可归结为类希尔方程求解；
The time evolution of system in two photon Jaynes Cummings (J C) model without rotating waves approximation (RWA) is obtained by using the theory of ordinary differential equations.
采用常微分方程理论研究了无旋波近似下双光子J-C模型系统的时间演化。
But the RWA in mesh networks is a NP-hard problem which can not be solved optimally with exhaustive search in the endurable time. Hence, we designed a heuristic algorithm to solve it.
而格状网络中的RWA是个NP -难问题，它不可能在有限的时间内通过穷举搜索来获得其优化解，为此我们设计了一个启发性算法以解决这个问题。
But the RWA in mesh networks is a NP-hard problem which can not be solved optimally with exhaustive search in the endurable time. Hence, we designed a heuristic algorithm to solve it.
而格状网络中的RWA是个NP -难问题，它不可能在有限的时间内通过穷举搜索来获得其优化解，为此我们设计了一个启发性算法以解决这个问题。
应用推荐