Keywords
- Optimal Algorithm
- Initial Length
- Optimal Distribution
- Optimal Search
- Computational Error
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R.E. Bellman, S.E. Dreyfus. Applied dynamic programming. Princeton University Press, Princeton, 1962.
Ф.Л. Черноусько. Об оптймальном пойске кория Функции, вычисдяемой приблизенно. Доклчды Академии наук СССР, 1967, тон 177, No I, стр. 48–51.
Ф.Д. Черноусько. Оптимальный алгоритм поиска корня Фынкуии, вычисляемой приблизенно. Журнал вычислительной математики и математической Физикй, том 8, No 4, 1968, стр. 705–724.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1970 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chernousko, F.L. (1970). On optimal algorithms for search. In: Moiseev, N.N. (eds) Colloquium on Methods of Optimization. Lecture Notes in Mathematics, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060199
Download citation
DOI: https://doi.org/10.1007/BFb0060199
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04901-2
Online ISBN: 978-3-540-36204-3
eBook Packages: Springer Book Archive
