arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.6489cs.CEcs.GT
收藏

在线金融算法竞争分析

Online Financial Algorithms Competitive Analysis

Sandeep Kumar, Deepak Garg

摘要:

在完全了解算法输入的情况下分析算法有时并不符合我们的期望。很多时候,我们被这样的场景所包围,在这些场景中,输入是在没有任何先验知识的情况下生成的。在线算法已经在计算机工程的广泛领域中找到了它们的适用性。其中,在线金融算法是最重要的领域之一,人们已经做出了大量的努力来产生一个有效的算法。在本文中,各种在线算法已审查其效率和各种替代措施进行了探讨分析的目的。

英文摘要:

Analysis of algorithms with complete knowledge of its inputs is sometimes not up to our expectations. Many times we are surrounded with such scenarios where inputs are generated without any prior knowledge. Online Algorithms have found their applicability in broad areas of computer engineering. Among these, an online financial algorithm is one of the most important areas where lots of efforts have been used to produce an efficient algorithm. In this paper various Online Algorithms have been reviewed for their efficiency and various alternative measures have been explored for analysis purposes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑