## Abstract Let __T__ be an extension of Robinson's arithmetic Q. Then __T__ is incomplete even if the set of the GΓΆdel numbers of all axioms of __T__ is β~2~.
A note on Bertsekas' small-label-first strategy
β Scribed by Chen, Zhi-Long; Powell, Warren B.
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 103 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
β¦ Synopsis
An example is presented to show that the worst-case complexity of Bertsekas' small-labelfirst strategy for the shortest path problem is exponential. It becomes polynomial if, when scanning a node i, its successors j β G(i) are examined in the nondecreasing order of d ij , the distance between i and j.
π SIMILAR VOLUMES
## Abstract We characterize conditions under which the regime switching (RS) hedge strategy will perform better than the ordinary least squares (OLS) hedge strategy. The result can be extended to the case where the GARCH effects prevail. Specifically, these conditions would allow the RSβGARCH hedge
The completeness, for consequence-finding, of various linear resolution strategies is siudied. Linear resolution with merging and subsL'mption is complete. A.ordered, linear resolution with merging J;Β’, in a certain sense, complete. Linear resolution with merging and C.ordering is incomplete. It is
## Abstract This note considers the hedging effectiveness of a dynamic hedge strategy as compared to the conventional OLS strategy. The conditions for the superiority of the OLS strategy are identified. It is argued that these conditions are frequently satisfied and therefore one expects to find th