传统的基于有限域的离散对数问题因为可以使用指标计算方法而存在亚指数时间算法求解。
The classical discrete logarithm problem in finite prime fields can be solved in an expected time which is subexponential in the group size via the socalled index calculus method.
该公司开始卖出价值为41亿美元的“电子迷你”期货合约，这些合约以一种算法交易形式建立在标准普尔500指数之上，只考虑交易量而不考虑时间和价格因素。
The firm started to sell $4.1 billion of “E-Mini” futures contracts based on the S&P 500 index through an algorithmic trade, taking account only of volume, not time or price.
一直以来，最优解的排课算法的时间复杂度大多是排课规模的指数阶。
The complexity of optimum-solution schedule arrangement algorithm has almost been exponent degree of schedule scale.
将该算法应用于交通方案优化设计，要求路径、时间、舒适安全指数三个目标能同时达到最优，通过仿真实验对优化结果进行了分析比较。
The algorithm apply to design in the transportation project, requesting route, time, comfort safety index can attain superior in the meantime, pass an experiment carry on the analysis comparison.
基础结构会使用指数倒退演算法，根据计算出来的平均来回时间决定何时重新传输。
The infrastructure USES an exponential back-off algorithm to determine when to retransmit, based on a computed average round-trip time.
为了选择最优路径，综合考虑出行时间、出行费用和换乘次数等因素，给出一个综合评价指数模型，并用算例对算法和模型的可行性进行验证。
In order to select optimum route, thinking about the factors which are time of transfers, cost of running and times of transfers, a compound evaluation index model is obtained.
首次把完全匹配层(PML)边界条件应用到adi FDTD计算中，采用幂指数形式的时间步进算法，推导了相应的迭代公式。
The perfect matched layer (PML) technique is used in ADI-FDTD calculation for the first time. The expressions for the exponential time-stepping algorithm in PML are derived.
又以预测误差平方和SSE最小为目标，构造了优选并自动生成最佳平滑参数使平滑模型得以优化的最速下降算法，增强了指数平滑模型对时间序列的适应能力。
Aiming the square sum of error (SSE), we construct the algorithm to iterate and select an optimal parameter for optimizing the new models, which ADAPTS the model to time series more.
实际系统的计算结果表明，此算法的迭代收敛次数稳定，与系统规模关系不大，在求解大规模系统无功优化问题时，其性能优于具有指数时间复杂性的单纯性法。
The computation results of practical power systems show that the number of iterations of this algorithm is independent of system's size, and it is superior to simplex...
考虑到算法映射问题的NP复杂度和求解时间的指数性增加，本文主要研究两步规划方法，即先进行数据流图的最优规划，然后进行处理器的映射。
Because of the NP complexity of mapping problem, the thesis studies two-step method: optimal scheduling of data flow graph and optimal processor mapping.
考虑到算法映射问题的NP复杂度和求解时间的指数性增加，本文主要研究两步规划方法，即先进行数据流图的最优规划，然后进行处理器的映射。
Because of the NP complexity of mapping problem, the thesis studies two-step method: optimal scheduling of data flow graph and optimal processor mapping.
应用推荐