网络联机算法 网络释义 1. 联机算法 具有这种特性的算法叫做联机算法(on-line algorithm)。仅需要常量空间并以线性时间运行的联机算法几乎是完美的算法。 baike.baidu.com|基于12个网页 例句 释义: 全部,联机算法
An on-line algorithm for rea -time accompanymnetRoger Dannenberg
Referred to by Erratum to “An on-line algorithm for creating self-organizing fuzzy neural networks” [Neural Netw. 17 (10) (2004) 1477–1493] Neural Networks, Volume 19, Issues 6–7, July–August 2006, Pages 974 Gang Leng, Girijesh Prasad, Thomas Martin McGinnityView PDF ...
on-line algorithmactive portfolio managementtransaction costssimulationAn on-line portfolio management algorithm using additive update rule is presented with consideration of proportional transaction costs. After establishing a relationship between transaction costs and the distance of two portfolio vectors, we ...
On-line algorithms for computing exponentials and logarithmsWe propose a new on-line algorithm for fast evaluation of logarithms and exponentials. This algorithm is derived from the widely studied Briggs-De Lugish iteration. We examine various compromises between the on-line delay and the size of...
Fusco.A New On-Line Algorithm for Inverse Kinematics of Robot Manipulators Ensuring Path Tracking Capability Under Joint Limits. IEEE Transaction on Robotics... G Antonelli,S Chiaverini,G Fusco - 《IEEE Transactions on Robotics & Automation》 被引量: 0发表: 2003年 Kinematic control of redundant ...
Saks. An optimal online algorithm for metrical task systems. In Nineteenth Annual ACM Symposium on Theory of Computing, pages 373–382, 1987. Google Scholar A. K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute ...
the algorithm does not use a short record of history sample to define the threshold of weak classifier.The algorithm first takes each output of the weak classifier as a random variable,and then estimates its density function.The whole density function of the strong classifier is estimated by ...
Peihai Liu and Xiwen Lu. A best possible on-line algorithm for two- machine flow shop scheduling to minimize makespan. Computers & Operations Research, 51:251-256, 2014.
A randomized algorithm for that ancient scheduling problem. In Proc. of the 5th Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 1272, 210–223. Springer-Verlag, 1997. Google Scholar J. Sgall. On-Line Scheduling on Parallel Machines. PhD thesis, Technical Report ...