An algorithm for sequential tail value at risk for path-independent payoffs in a binomial tree

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.181, Iss.1, 2010-12, pp. : 463-483

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

基于广度优先遍历的关键路线生成树算法 A Critical Path Spanning Tree Algorithm Based on Breadth-First Traversal

By 付冬梅练丁榑

Computer Science and Application, Vol. 02, Iss. 02, 2012-06 ,pp. : 51-56

汉斯出版社

Access to resources Recommend Favorite

An Efficient Tree-Based Multicasting Algorithm on Wormhole-Routed Star Graph Interconnection Networks Embedded with Hamiltonian Path

By Wang Nen-Chung Chu Chih-Ping

The Journal of Supercomputing, Vol. 34, Iss. 1, 2005-10 ,pp. : 5-26

Springer Publishing Company

Access to resources Recommend Favorite

A parallel algorithm for optimizing the capital structure contingent on maximum value at risk

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 44, Iss. 3, 2015-03 ,pp. : 384-405

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

The suffix tree of a tree and minimizing sequential transducers

By Breslauer D.

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 131-144

Elsevier

Access to resources Recommend Favorite

A Sequential Algorithm for Generating Random Graphs

By Bayati Mohsen Kim Jeong Saberi Amin

Algorithmica, Vol. 58, Iss. 4, 2010-12 ,pp. : 860-910

Springer Publishing Company

Access to resources Recommend Favorite