通过从一个配置跳跃到一个差异巨大的配置，然后再进行细小的调整来让能量最小化，罗塞塔算法以此来处理其需要扫描的这巨大的能量图景。
The Rosetta algorithm handles the huge energy landscape it needs to scan by taking big leaps between different configurations, then attempting to minimize the energy by making smaller tweaks.
提出了一种基于平均分组时延与分组能量消耗乘积最小的路由路径选择算法。
A routing path selected algorithm based on the minimization product of packet delay and packet energy consumption is proposed.
给出了一种基于频段能量归一化处理的宽带最小方差无失真响应算法。
An algorithm of broadband minimum variance distortionless response (MVDR) based on the frequency energy normalization was proposed.
算法以最优流法为基础，以一段时间内的能量损耗最小为目标函数。
The algorithms are based on the optimal flow pattern and the objective function is the minimum of energy loss during a period of time.
仿真表明，该算法可以动态调整网络路由路径，使所选路径的平均分组时延与分组能量消耗乘积达到最小。
Simulation demonstrated that the algorithm could dynamic adjust the route which can make the product of packet delay and energy consumption of routing path to be minimization in AD hoc networks.
本文对基于虚拟MIMO协作多跳广播的能量最小广播问题进行了探讨，并对其经典贪婪算法GF A进行了改进。
In this paper, describe the minimum energy broadcasting problem which based virtual MIMO cooperative multihop broadcasting schedule, and improve the GFA algorithm.
仿真表明，该算法可以动态调整网络路由路径，从而使所选路径的能量消耗达到最小。
Simulation demonstrated that the algorithm could dynamic adjust the route that can achieve the aim of the minimization of energy consumed of routing path in AD hoc networks.
这种盲检测算法基于最小平均输出能量准则，本质上是一个有约束的最优化问题。
Based on the minimum output energy criterion, the algorithm is formulated as a constrained optimization problem inherently and is then resolved efficiently by using neural network.
从移动机器人运动能量损耗的角度对移动机器人全局环境未知时的路径规划问题进行了探索，提出了一种新的基于局部最小能量的路径规划算法。
The robot path planning under unknown plane environments is reviewed from an energy-consuming viewpoint, and a novel path planning algorithm based on the local minimum energy is proposed.
提出一种基于暂态能量的故障选线自适应方法，利用所有健全线路暂态能量与故障线路暂态能量之差为最小值的原理，构成故障选线算法。
This paper presents an adaptive fault circuit selection method based on the principle that the difference of transient energy of normal circuits and that of fault circuit is.
最后，在行为级，本文提出了一种基于最小能量的算子调度算法，对折叠循环结构的控制数据流图进行算子调度。
At last, at the behavioral level, this dissertation proposes a minimal-energy based operator scheduling approach to perform operator scheduling for loop folding CDFG structure.
在分析了最小跳数路由算法的局限性基础上提出了最优跳数算法，该算法充分考虑了无线传感器网络的跳数、能量、负载问题，以求在三者平衡中达到网络路由的最优。
This article analyses the best hop routing algorithms hop routing, energy, and load of wireless sensor network's to achieve a balance in all the optimum network routing.
LQR算法是在特定白勺性能指标下，利用最少白勺控制能量，来到达最小白勺状态误差。
LQR algorithm USES the least control energy under certain performance index to achieve the smallest state errors.
文中给出两种活动轮廓模型，其中一种基于边缘停止函数，而另一种是一个能量最小化算法。
Two active contour models, one based on an edge-stopping function, while the other is an energy minimization algorithm, are demonstrated.
给出了在WSN中多点对一点通信的最小能耗路径和节点能量最大路径的矩阵算法。
A matrix algorithm of minimal energy-consuming path and a matrix algorithm of maximal node-energy path for multiple points to one point communication in WSN are given.
该算法的特点是将能量最小法则和奇异值分解结合起来，在代数空间中建立了一种自适应的图像降噪算法。
Comparing with the adaptive denoising algorithm based on compression ratio and SVD, it avoids calculating the function of image compression ratio and its knee point.
节点根据能量消耗的代价来选择至簇头的路由，通过扩散算法来广播代价消息，采用贪婪算法来选择能量消耗最小的路径；
The new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link;
节点根据能量消耗的代价来选择至簇头的路由，通过扩散算法来广播代价消息，采用贪婪算法来选择能量消耗最小的路径；
The new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link;
应用推荐