Abstract
THE concept of best sequential search strategy when finding an extremum is introduced. The problem of finding the strategies which are best in a class of functions satisfying a condition of the Lipschitz type is reduced to geometric and combinatorial problems of optimal coverings. The best strategies are obtained for certain cases, while in others approximations to them are offered.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: USSR Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
